Nonlinear programming without a penalty function or a filter
From MaRDI portal
Publication:847849
DOI10.1007/s10107-008-0244-7zbMath1216.90069WikidataQ58185767 ScholiaQ58185767MaRDI QIDQ847849
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/42072
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
90C55: Methods of successive quadratic programming type
Related Items
A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming, On the behaviour of constrained optimization methods when Lagrange multipliers do not exist, A line search exact penalty method with bi-object strategy for nonlinear constrained optimization, A globally convergent penalty-free method for optimization with equality constraints and simple bounds, A new penalty-free-type algorithm based on trust region techniques, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, qpOASES: a parametric active-set algorithm for~quadratic programming, Algorithm for calculating the analytic solution for economic dispatch with multiple fuel units, Erratum to: ``Nonlinear programming without a penalty function or a filter, Global and local convergence of a class of penalty-free-type methods for nonlinear programming, Trust-region and other regularisations of linear least-squares problems, A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations, Linear equalities in blackbox optimization, A derivative-free trust-funnel method for equality-constrained nonlinear optimization, An exterior point polynomial-time algorithm for convex quadratic programming, Recent advances in trust region algorithms, Constrained derivative-free optimization on thin domains, A trust-region SQP method without a penalty or a filter for nonlinear programming, A line search SQP method without a penalty or a filter, On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization, Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Erratum to: ``Nonlinear programming without a penalty function or a filter
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization
- Analysis of Inexact Trust-Region SQP Algorithms
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- An Inexact SQP Method for Equality Constrained Optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- Trust Region Methods
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- A Reduced Hessian Method for Large-Scale Constrained Optimization
- A trust region method based on interior point techniques for nonlinear programming.
- Nonlinear programming without a penalty function.
