A globally convergent regularized interior point method for constrained optimization (Q5058383)

scientific article; zbMATH DE number 7634889

Language	Label	Description	Also known as
English	A globally convergent regularized interior point method for constrained optimization	scientific article; zbMATH DE number 7634889

Statements

instance of

scholarly article

0 references

title

A globally convergent regularized interior point method for constrained optimization (English)

0 references

author

Songqiang Qiu

0 references

published in

Optimization Methods and Software

0 references

publication date

20 December 2022

0 references

zbMATH Keywords

regularized interior point method

0 references

trust-funnel-like scheme

0 references

relaxed constant rank constraint qualification

0 references

global convergence

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10556788.2021.1908283

0 references

cites work

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

0 references

On Augmented Lagrangian Methods with General Lower-Level Constraints

0 references

A relaxed constant positive linear dependence constraint qualification and applications

0 references

Two New Weak Constraint Qualifications and Applications

0 references

From global to local convergence of interior methods for nonlinear optimization

0 references

A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization

0 references

A Regularized Factorization-Free Method for Equality-Constrained Optimization

0 references

Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks

0 references

Constraint Preconditioners for Symmetric Indefinite Matrices

0 references

An Interior Point Algorithm for Large-Scale Nonlinear Programming

0 references

A trust region method based on interior point techniques for nonlinear programming.

0 references

Q3837875

0 references

Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties

0 references

An interior-point piecewise linear penalty method for nonlinear programming

0 references

A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints

0 references

A primal-dual trust-region algorithm for non-convex nonlinear programming

0 references

A primal–dual regularized interior-point method for semidefinite programming

0 references

Benchmarking optimization software with performance profiles.

0 references

Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization

0 references

An inexact restoration strategy for the globalization of the sSQP method

0 references

Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems

0 references

Nonlinear programming without a penalty function.

0 references

Q4464636

0 references

Primal-Dual Interior Methods for Nonconvex Nonlinear Programming

0 references

A primal-dual regularized interior-point method for convex quadratic programs

0 references

A stabilized SQP method: global convergence

0 references

A stabilized SQP method: superlinear convergence

0 references

A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization

0 references

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

0 references

A Globally Convergent Stabilized SQP Method

0 references

Interior point methods 25 years later

0 references

Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks

0 references

Nonlinear programming without a penalty function or a filter

0 references

On the global convergence of interior-pointnonlinear programming algorithms

0 references

Stabilized sequential quadratic programming

0 references

Test examples for nonlinear programming codes

0 references

Newton-Type Methods for Optimization Problems without Constraint Qualifications

0 references

On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers

0 references

Stabilized SQP revisited

0 references

Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function

0 references

Subspace-stabilized sequential quadratic programming

0 references

Directional derivative of the marginal function in nonlinear programming

0 references

A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm

0 references

A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs

0 references

On relaxed constant rank regularity condition in mathematical programming

0 references

Q4151662

0 references

Convergence of a stabilized SQP method for equality constrained optimization

0 references

On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods

0 references

Global and local convergence of a class of penalty-free-type methods for nonlinear programming

0 references

An interior point method for nonlinear optimization with a quasi-tangential subproblem

0 references

An adaptively regularized sequential quadratic programming method for equality constrained optimization

0 references

Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints

0 references

A stabilized filter SQP algorithm for nonlinear programming

0 references

Q3998482

0 references

LOQO:an interior point code for quadratic programming

0 references

An interior-point algorithm for nonconvex nonlinear programming

0 references

Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence

0 references

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

0 references

An interior algorithm for nonlinear optimization that combines line search and trust region steps

0 references

Q5691079

0 references

Superlinear convergence of a stabilized SQP method to a degenerate solution

0 references

Modifying SQP for Degenerate Problems

0 references

An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence

0 references

A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization

0 references

Q4382667

0 references

Identifiers

DOI

10.1080/10556788.2021.1908283

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5058383