Pages that link to "Item:Q1019803"
From MaRDI portal
The following pages link to A penalty-function-free line search SQP method for nonlinear programming (Q1019803):
Displaying 13 items.
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
- A line search penalty-free method for nonlinear second-order cone programming (Q829562) (← links)
- An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
- A penalty-free method with line search for nonlinear equality constrained optimization (Q1792357) (← links)
- Optimal maximally decimated m-channel mirrored paraunitary linear phase FIR filter bank design via norm relaxed sequential quadratic programming (Q1983745) (← links)
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming (Q2125656) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- A line search SQP method without a penalty or a filter (Q2516801) (← links)
- On the Local Convergence of a Penalty-Function-Free SQP Method (Q4979789) (← links)
- A central path interior point method for nonlinear programming and its local convergence (Q5028593) (← links)
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)
- Iterative distributed model predictive control for nonlinear systems with coupled non-convex constraints and costs (Q6577235) (← links)
