Skip to content

[backport] Add availability flags in NLPModelMeta and NLSMeta #525

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
amontoison wants to merge 3 commits into
base: 0.21.x
Choose a base branch
from
Open

[backport] Add availability flags in NLPModelMeta and NLSMeta #525

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
b365961
Add availability flags in NLPModelMeta and NLSMeta
amontoison Dec 1, 2025
e7e9905
Rename the new attributes
amontoison Dec 3, 2025
330bdad
Update the documentation of some functions
amontoison Dec 4, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
72 changes: 40 additions & 32 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -84,38 +84,46 @@ The complete list of methods that an interface may implement can be found in the

`NLPModelMeta` objects have the following attributes (with `S <: AbstractVector`):

Attribute | Type | Notes
------------|--------------------|------------------------------------
`nvar` | `Int ` | number of variables
`x0 ` | `S` | initial guess
`lvar` | `S` | vector of lower bounds
`uvar` | `S` | vector of upper bounds
`ifix` | `Vector{Int}` | indices of fixed variables
`ilow` | `Vector{Int}` | indices of variables with lower bound only
`iupp` | `Vector{Int}` | indices of variables with upper bound only
`irng` | `Vector{Int}` | indices of variables with lower and upper bound (range)
`ifree` | `Vector{Int}` | indices of free variables
`iinf` | `Vector{Int}` | indices of visibly infeasible bounds
`ncon` | `Int ` | total number of general constraints
`nlin ` | `Int ` | number of linear constraints
`nnln` | `Int ` | number of nonlinear general constraints
`y0 ` | `S` | initial Lagrange multipliers
`lcon` | `S` | vector of constraint lower bounds
`ucon` | `S` | vector of constraint upper bounds
`lin ` | `Vector{Int}` | indices of linear constraints
`nln` | `Vector{Int}` | indices of nonlinear constraints
`jfix` | `Vector{Int}` | indices of equality constraints
`jlow` | `Vector{Int}` | indices of constraints of the form c(x) ≥ cl
`jupp` | `Vector{Int}` | indices of constraints of the form c(x) ≤ cu
`jrng` | `Vector{Int}` | indices of constraints of the form cl ≤ c(x) ≤ cu
`jfree` | `Vector{Int}` | indices of "free" constraints (there shouldn't be any)
`jinf` | `Vector{Int}` | indices of the visibly infeasible constraints
`nnzo` | `Int ` | number of nonzeros in the gradient
`nnzj` | `Int ` | number of nonzeros in the sparse Jacobian
`nnzh` | `Int ` | number of nonzeros in the sparse Hessian
`minimize` | `Bool ` | true if `optimize == minimize`
`islp` | `Bool ` | true if the problem is a linear program
`name` | `String` | problem name
Attribute | Type | Notes
-------------------|---------------|------------------------------------
`nvar` | `Int` | number of variables
`x0 ` | `S` | initial guess
`lvar` | `S` | vector of lower bounds
`uvar` | `S` | vector of upper bounds
`ifix` | `Vector{Int}` | indices of fixed variables
`ilow` | `Vector{Int}` | indices of variables with lower bound only
`iupp` | `Vector{Int}` | indices of variables with upper bound only
`irng` | `Vector{Int}` | indices of variables with lower and upper bound (range)
`ifree` | `Vector{Int}` | indices of free variables
`iinf` | `Vector{Int}` | indices of visibly infeasible bounds
`ncon` | `Int` | total number of general constraints
`nlin ` | `Int` | number of linear constraints
`nnln` | `Int` | number of nonlinear general constraints
`y0 ` | `S` | initial Lagrange multipliers
`lcon` | `S` | vector of constraint lower bounds
`ucon` | `S` | vector of constraint upper bounds
`lin ` | `Vector{Int}` | indices of linear constraints
`nln` | `Vector{Int}` | indices of nonlinear constraints
`jfix` | `Vector{Int}` | indices of equality constraints
`jlow` | `Vector{Int}` | indices of constraints of the form c(x) ≥ cl
`jupp` | `Vector{Int}` | indices of constraints of the form c(x) ≤ cu
`jrng` | `Vector{Int}` | indices of constraints of the form cl ≤ c(x) ≤ cu
`jfree` | `Vector{Int}` | indices of "free" constraints (there shouldn't be any)
`jinf` | `Vector{Int}` | indices of the visibly infeasible constraints
`nnzo` | `Int` | number of nonzeros in the gradient
`nnzj` | `Int` | number of nonzeros in the sparse Jacobian
`lin_nnzj` | `Int` | number of nonzeros in the sparse linear constraints Jacobian
`nln_nnzj` | `Int` | number of nonzeros in the sparse nonlinear constraints Jacobian
`nnzh` | `Int` | number of nonzeros in the lower triangular part of the sparse Hessian of the Lagrangian
`minimize` | `Bool` | true if `optimize == minimize`
`islp` | `Bool` | true if the problem is a linear program
`name` | `String` | problem name
`grad_available` | `Bool` | true if the gradient of the objective is available
`jac_available` | `Bool` | true if the sparse Jacobian of the constraints is available
`hess_available` | `Bool` | true if the sparse Hessian of the Lagrangian is available
`jprod_available` | `Bool` | true if the Jacobian-vector product `J * v` is available
`jtprod_available` | `Bool` | true if the transpose Jacobian-vector product `J' * v` is available
`hprod_available` | `Bool` | true if the Hessian-vector product of the Lagrangian `H * v` is available

# Bug reports and discussions

Expand Down
74 changes: 40 additions & 34 deletions docs/src/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -79,40 +79,46 @@ See the [Models](@ref), the [Tools](@ref tools-section), or the [API](@ref).

`NLPModelMeta` objects have the following attributes (with `S <: AbstractVector`):

Attribute | Type | Notes
------------|--------------------|------------------------------------
`nvar` | `Int ` | number of variables
`x0 ` | `S` | initial guess
`lvar` | `S` | vector of lower bounds
`uvar` | `S` | vector of upper bounds
`ifix` | `Vector{Int}` | indices of fixed variables
`ilow` | `Vector{Int}` | indices of variables with lower bound only
`iupp` | `Vector{Int}` | indices of variables with upper bound only
`irng` | `Vector{Int}` | indices of variables with lower and upper bound (range)
`ifree` | `Vector{Int}` | indices of free variables
`iinf` | `Vector{Int}` | indices of visibly infeasible bounds
`ncon` | `Int ` | total number of general constraints
`nlin ` | `Int ` | number of linear constraints
`nnln` | `Int ` | number of nonlinear general constraints
`y0 ` | `S` | initial Lagrange multipliers
`lcon` | `S` | vector of constraint lower bounds
`ucon` | `S` | vector of constraint upper bounds
`lin ` | `Vector{Int}` | indices of linear constraints
`nln` | `Vector{Int}` | indices of nonlinear constraints
`jfix` | `Vector{Int}` | indices of equality constraints
`jlow` | `Vector{Int}` | indices of constraints of the form c(x) ≥ cl
`jupp` | `Vector{Int}` | indices of constraints of the form c(x) ≤ cu
`jrng` | `Vector{Int}` | indices of constraints of the form cl ≤ c(x) ≤ cu
`jfree` | `Vector{Int}` | indices of "free" constraints (there shouldn't be any)
`jinf` | `Vector{Int}` | indices of the visibly infeasible constraints
`nnzo` | `Int ` | number of nonzeros in the gradient
`nnzj` | `Int ` | number of nonzeros in the sparse Jacobian
`lin_nnzj` | `Int ` | number of nonzeros in the sparse linear constraints Jacobian
`nln_nnzj` | `Int ` | number of nonzeros in the sparse nonlinear constraints Jacobian
`nnzh` | `Int ` | number of nonzeros in the lower triangular part of the sparse Hessian of the Lagrangian
`minimize` | `Bool ` | true if `optimize == minimize`
`islp` | `Bool ` | true if the problem is a linear program
`name` | `String` | problem name
Attribute | Type | Notes
-------------------|---------------|------------------------------------
`nvar` | `Int` | number of variables
`x0 ` | `S` | initial guess
`lvar` | `S` | vector of lower bounds
`uvar` | `S` | vector of upper bounds
`ifix` | `Vector{Int}` | indices of fixed variables
`ilow` | `Vector{Int}` | indices of variables with lower bound only
`iupp` | `Vector{Int}` | indices of variables with upper bound only
`irng` | `Vector{Int}` | indices of variables with lower and upper bound (range)
`ifree` | `Vector{Int}` | indices of free variables
`iinf` | `Vector{Int}` | indices of visibly infeasible bounds
`ncon` | `Int` | total number of general constraints
`nlin ` | `Int` | number of linear constraints
`nnln` | `Int` | number of nonlinear general constraints
`y0 ` | `S` | initial Lagrange multipliers
`lcon` | `S` | vector of constraint lower bounds
`ucon` | `S` | vector of constraint upper bounds
`lin ` | `Vector{Int}` | indices of linear constraints
`nln` | `Vector{Int}` | indices of nonlinear constraints
`jfix` | `Vector{Int}` | indices of equality constraints
`jlow` | `Vector{Int}` | indices of constraints of the form c(x) ≥ cl
`jupp` | `Vector{Int}` | indices of constraints of the form c(x) ≤ cu
`jrng` | `Vector{Int}` | indices of constraints of the form cl ≤ c(x) ≤ cu
`jfree` | `Vector{Int}` | indices of "free" constraints (there shouldn't be any)
`jinf` | `Vector{Int}` | indices of the visibly infeasible constraints
`nnzo` | `Int` | number of nonzeros in the gradient
`nnzj` | `Int` | number of nonzeros in the sparse Jacobian
`lin_nnzj` | `Int` | number of nonzeros in the sparse linear constraints Jacobian
`nln_nnzj` | `Int` | number of nonzeros in the sparse nonlinear constraints Jacobian
`nnzh` | `Int` | number of nonzeros in the lower triangular part of the sparse Hessian of the Lagrangian
`minimize` | `Bool` | true if `optimize == minimize`
`islp` | `Bool` | true if the problem is a linear program
`name` | `String` | problem name
`grad_available` | `Bool` | true if the gradient of the objective is available
`jac_available` | `Bool` | true if the sparse Jacobian of the constraints is available
`hess_available` | `Bool` | true if the sparse Hessian of the Lagrangian is available
`jprod_available` | `Bool` | true if the Jacobian-vector product `J * v` is available
`jtprod_available` | `Bool` | true if the transpose Jacobian-vector product `J' * v` is available
`hprod_available` | `Bool` | true if the Hessian-vector product of the Lagrangian `H * v` is available

## License

Expand Down
Loading
Loading