Interior-point _2-penalty methods for nonlinear programming with strong global convergence properties
From MaRDI portal
Publication:2494514
Recommendations
- An interior-point _1-penalty method for nonlinear optimization
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- On the global convergence of interior-pointnonlinear programming algorithms
- A globally convergent interior point algorithm for non-convex nonlinear programming
- scientific article; zbMATH DE number 5524381
- A penalized interior point approach for constrained nonlinear programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A penalty-free primal-dual interior-point algorithm and its global convergence
- An interior-point piecewise linear penalty method for nonlinear programming
- Globally convergent interior-point algorithm for nonlinear programming
Cites work
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- A Globally Convergent Filter Method for Nonlinear Programming
- A globally convergent primal-dual interior point method for constrained optimization
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A modified barrier-augmented Lagrangian method for constrained minimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A primal-dual trust region algorithm for nonlinear optimization
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- A robust sequential quadratic programming method
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- A trust region method based on interior point techniques for nonlinear programming.
- An augmented Lagrangian interior-point method using directions of negative curvature
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
- An interior-point algorithm for nonconvex nonlinear programming
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- Feasible interior methods using slacks for nonlinear optimization
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- Global convergence of a primal-dual interior-point method for nonlinear programming
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global convergence of the Newton interior-point method for nonlinear programming
- scientific article; zbMATH DE number 1183039 (Why is no real title available?)
- scientific article; zbMATH DE number 1186888 (Why is no real title available?)
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 1568981 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Inertia-controlling factorizations for optimization algorithms
- Interior Methods for Nonlinear Optimization
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Nonlinear programming without a penalty function.
- On the convergence of Newton iterations to non-stationary points
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the Global Convergence of a Filter--SQP Algorithm
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
- Test examples for nonlinear programming codes
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
Cited in
(40)- An approximate strong KKT condition for multiobjective optimization
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- On the solution of linearly constrained optimization problems by means of barrier algorithms
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- A penalty-interior-point algorithm for nonlinear constrained optimization
- On the augmented subproblems within sequential methods for nonlinear programming
- A new class of exact penalty functions and penalty algorithms
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- Differentiable local barrier-penalty paths
- A stabilized filter SQP algorithm for nonlinear programming
- An interior-point _1-penalty method for nonlinear optimization
- A cone-continuity constraint qualification and algorithmic consequences
- Steering exact penalty methods for nonlinear programming
- A penalized interior point approach for constrained nonlinear programming
- A line search exact penalty method using steering rules
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Study of a primal-dual algorithm for equality constrained minimization
- Solving the nonsmooth bi-objective environmental and economic dispatch problem using smoothing functions
- A globally convergent regularized interior point method for constrained optimization
- Approximate solutions to nonsmooth multiobjective programming problems
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Structured regularization for barrier NLP solvers
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- An interior-point piecewise linear penalty method for nonlinear programming
- Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
- On optimality conditions for nonlinear conic programming
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- On the global convergence of interior-pointnonlinear programming algorithms
- A line search exact penalty method with bi-object strategy for nonlinear constrained optimization
- Approximate KKT conditions for generalized bilevel optimization with a variational-inequality lower level
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
This page was built for publication: Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494514)
