Pages that link to "Item:Q847849"
From MaRDI portal
The following pages link to Nonlinear programming without a penalty function or a filter (Q847849):
Displayed 22 items.
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
- A new penalty-free-type algorithm based on trust region techniques (Q387487) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- Algorithm for calculating the analytic solution for economic dispatch with multiple fuel units (Q660866) (← links)
- Erratum to: ``Nonlinear programming without a penalty function or a filter'' (Q662297) (← links)
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
- Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
- A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations (Q2019006) (← links)
- Linear equalities in blackbox optimization (Q2340487) (← links)
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization (Q2340488) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- Constrained derivative-free optimization on thin domains (Q2392122) (← links)
- A trust-region SQP method without a penalty or a filter for nonlinear programming (Q2515095) (← links)
- A line search SQP method without a penalty or a filter (Q2516801) (← links)
- On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization (Q2634338) (← links)
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints (Q2815544) (← links)
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming (Q5245841) (← links)
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist (Q5746720) (← links)
- A line search exact penalty method with bi-object strategy for nonlinear constrained optimization (Q5964608) (← links)