A globally convergent regularized interior point method for constrained optimization
From MaRDI portal
Publication:5058383
DOI10.1080/10556788.2021.1908283OpenAlexW3147730223MaRDI QIDQ5058383
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1908283
global convergencerelaxed constant rank constraint qualificationregularized interior point methodtrust-funnel-like scheme
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- A stabilized filter SQP algorithm for nonlinear programming
- A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints
- Stabilized SQP revisited
- Interior point methods 25 years later
- Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks
- A stabilized SQP method: superlinear convergence
- An interior-point piecewise linear penalty method for nonlinear programming
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- A relaxed constant positive linear dependence constraint qualification and applications
- Nonlinear programming without a penalty function or a filter
- Test examples for nonlinear programming codes
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- An interior-point algorithm for nonconvex nonlinear programming
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- A primal-dual regularized interior-point method for convex quadratic programs
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- Subspace-stabilized sequential quadratic programming
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- An inexact restoration strategy for the globalization of the sSQP method
- Convergence of a stabilized SQP method for equality constrained optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- 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
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints
- From global to local convergence of interior methods for nonlinear optimization
- Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization
- On relaxed constant rank regularity condition in mathematical programming
- Directional derivative of the marginal function in nonlinear programming
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Constraint Preconditioners for Symmetric Indefinite Matrices
- Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- LOQO:an interior point code for quadratic programming
- A Regularized Factorization-Free Method for Equality-Constrained Optimization
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- Newton-Type Methods for Optimization Problems without Constraint Qualifications
- A stabilized SQP method: global convergence
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Modifying SQP for Degenerate Problems
- Two New Weak Constraint Qualifications and Applications
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization
- A primal–dual regularized interior-point method for semidefinite programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- A Globally Convergent Stabilized SQP Method
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- A trust region method based on interior point techniques for nonlinear programming.
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
- On the global convergence of interior-pointnonlinear programming algorithms
