Nonlinear programming without a penalty function or a filter
DOI10.1007/S10107-008-0244-7zbMATH Open1216.90069OpenAlexW2095691822WikidataQ58185767 ScholiaQ58185767MaRDI QIDQ847849FDOQ847849
Authors: N. E. Zubov
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
Recommendations
- Nonlinear programming without a penalty function.
- A penalty-free method for equality constrained optimization
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- A penalty-free method with superlinear convergence for equality constrained optimization
- A trust-region SQP method without a penalty or a filter for nonlinear programming
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Trust Region Methods
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- A trust region method based on interior point techniques for nonlinear programming.
- Nonlinear programming without a penalty function.
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- A surperlinearly convergent algorithm for constrained optimization problems
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- Title not available (Why is that?)
- A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Analysis of inexact trust-region SQP algorithms
- Erratum to: ``Nonlinear programming without a penalty function or a filter
- An Inexact SQP Method for Equality Constrained Optimization
- A Reduced Hessian Method for Large-Scale Constrained Optimization
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
Cited In (48)
- A line search exact penalty method with bi-object strategy for nonlinear constrained optimization
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- 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
- A method without a penalty function or a filter for nonlinear constrained optimization
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Nonlinear programming without a penalty function.
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Global convergence of a new method for minimax problem without a penalty function or a filter
- Penalty-free method for nonsmooth constrained optimization via radial basis functions
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
- Trust-region and other regularisations of linear least-squares problems
- A globally convergent regularized interior point method for constrained optimization
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization
- On the connection between forward and optimization problem in one-shot one-step methods
- A line search SQP method without a penalty or a filter
- A local MM subspace method for solving constrained variational problems in image recovery
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Linear equalities in blackbox optimization
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- An overview of nonlinear optimization
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
- A penalty-free method with line search for nonlinear equality constrained optimization
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- Erratum to: ``Nonlinear programming without a penalty function or a filter
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- qpOASES: a parametric active-set algorithm for~quadratic programming
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- Recent advances in trust region algorithms
- An exterior point polynomial-time algorithm for convex quadratic programming
- A penalty-free method with superlinear convergence for equality constrained optimization
- Algorithm for calculating the analytic solution for economic dispatch with multiple fuel units
- An interior-point trust-funnel algorithm for nonlinear optimization
- A penalty-free method for equality constrained optimization
- A central path interior point method for nonlinear programming and its local convergence
- Convergence of a stabilized SQP method for equality constrained optimization
- A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
- Derivative-free optimization methods
- Constrained derivative-free optimization on thin domains
- Complexity analysis of a trust funnel algorithm for equality constrained optimization
Uses Software
This page was built for publication: Nonlinear programming without a penalty function or a filter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847849)