Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
From MaRDI portal
Publication:2494514
DOI10.1007/s10107-005-0701-5zbMath1142.90498OpenAlexW2125410188MaRDI QIDQ2494514
Publication date: 28 June 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0701-5
global convergencenonlinear programmingConstrained optimizationmodified Newton methodprimal-dual interior-point methodpenalty-barrier method
Related Items
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods, An approximate strong KKT condition for multiobjective optimization, A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, A stabilized filter SQP algorithm for nonlinear programming, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, A globally convergent regularized interior point method for constrained optimization, An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, A Cone-Continuity Constraint Qualification and Algorithmic Consequences, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, A penalty-interior-point algorithm for nonlinear constrained optimization, On the augmented subproblems within sequential methods for nonlinear programming, Solving Nonsmooth Bi-Objective Environmental andEconomic Dispatch Problem using Smoothing Techniques, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods, A line search exact penalty method using steering rules, A new class of exact penalty functions and penalty algorithms, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Steering exact penalty methods for nonlinear programming, Study of a primal-dual algorithm for equality constrained minimization, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, On the solution of linearly constrained optimization problems by means of barrier algorithms, Structured regularization for barrier NLP solvers, Penalized interior point approach for constrained nonlinear programming, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, An interior-point piecewise linear penalty method for nonlinear programming, Unnamed Item, A line search exact penalty method with bi-object strategy for nonlinear constrained optimization, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, On Optimality Conditions for Nonlinear Conic Programming, A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- Test examples for nonlinear programming codes
- An interior-point algorithm for nonconvex nonlinear programming
- A modified barrier-augmented Lagrangian method for constrained minimization
- An augmented Lagrangian interior-point method using directions of negative curvature
- Feasible interior methods using slacks for nonlinear optimization
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- On the convergence of Newton iterations to non-stationary points
- Global convergence of the Newton interior-point method for nonlinear programming
- Failure of global convergence for a class of interior point methods for nonlinear programming
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- A robust sequential quadratic programming method
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Inertia-controlling factorizations for optimization algorithms
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A primal-dual trust region algorithm for nonlinear optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
- A Globally Convergent Filter Method for Nonlinear Programming
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- On the Global Convergence of a Filter--SQP Algorithm
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Interior Methods for Nonlinear Optimization
- A globally convergent primal-dual interior point method for constrained optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- A trust region method based on interior point techniques for nonlinear programming.
- Nonlinear programming without a penalty function.
