Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification

Cites work

A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
A local convergence property of primal-dual methods for nonlinear programming
A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
A regularization method for constrained nonlinear least squares
A regularized factorization-free method for equality-constrained optimization
A second derivative SQP method: global convergence
A stabilized SQP method: superlinear convergence
A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
An interior point-proximal method of multipliers for convex quadratic programming
An interior-point algorithm for nonconvex nonlinear programming
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications
Constraint identification and algorithm stabilization for degenerate nonlinear programs
CUTEr and SifDec
Definite and Semidefinite Quadratic Forms
Determination of the inertia of a partitioned Hermitian matrix
Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
Effects of finite-precision arithmetic on interior-point methods for nonlinear programming
scientific article; zbMATH DE number 1818892 (Why is no real title available?)
scientific article; zbMATH DE number 1183039 (Why is no real title available?)
scientific article; zbMATH DE number 107545 (Why is no real title available?)
scientific article; zbMATH DE number 1059236 (Why is no real title available?)
scientific article; zbMATH DE number 6125590 (Why is no real title available?)
scientific article; zbMATH DE number 5066287 (Why is no real title available?)
Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
Local convergence of a primal-dual method for degenerate nonlinear programming
Local path-following property of inexact interior methods in nonlinear programming
MA57---a code for the solution of sparse symmetric definite and indefinite systems
Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
Modifying SQP for Degenerate Problems
On a primal-dual Newton proximal method for convex quadratic programs
On Augmented Lagrangian Methods with General Lower-Level Constraints
On the Accurate Identification of Active Constraints
On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
On the local quadratic convergence of the primal–dual augmented Lagrangian method
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
Regularized Newton methods for convex minimization problems with singular solutions
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Stability in the presence of degeneracy and error estimation
Stabilized sequential quadratic programming
Stabilized SQP revisited
Study of a primal-dual algorithm for equality constrained minimization
Superlinear convergence of a stabilized SQP method to a degenerate solution
Superlinear convergence of an interior-point method despite dependent constraints
Superlinear convergence of primal-dual interior point algorithms for nonlinear programming

This page was built for publication: Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6961463)