A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization (Q6642793)

scientific article; zbMATH DE number 7948914

Language	Label	Description	Also known as
English	A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization	scientific article; zbMATH DE number 7948914

Statements

instance of

scholarly article

0 references

title

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization (English)

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

25 November 2024

0 references

zbMATH Keywords

nonconvex conic optimization

0 references

second-order stationary point

0 references

augmented Lagrangian method

0 references

barrier method

0 references

Newton-conjugate gradient method

0 references

iteration complexity

0 references

operation complexity

0 references

MaRDI profile type

Publication

0 references

cites work

Finding approximate local minima faster than gradient descent

0 references

On Augmented Lagrangian Methods with General Lower-Level Constraints

0 references

A second-order sequential optimality condition associated to the convergence of optimization algorithms

0 references

On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming

0 references

A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization

0 references

Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization

0 references

Q4209222

0 references

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

0 references

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models

0 references

Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points

0 references

Practical Augmented Lagrangian Methods for Constrained Optimization

0 references

The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization

0 references

Sequential Quadratic Programming with Penalization of the Displacement

0 references

On the Complexity of an Inexact Restoration Method for Constrained Optimization

0 references

A Trust Region Algorithm for Nonlinearly Constrained Optimization

0 references

Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step

0 references

Accelerated Methods for NonConvex Optimization

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization

0 references

On the complexity of finding first-order critical points in constrained nonlinear optimization

0 references

On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods

0 references

Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization

0 references

An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

A new trust-region algorithm for equality constrained optimization

0 references

A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

0 references

Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization

0 references

Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem

0 references

A modified barrier-augmented Lagrangian method for constrained minimization

0 references

On the complexity of an augmented Lagrangian method for nonconvex optimization

0 references

Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary

0 references

A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees

0 references

A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees

0 references

An example comparing the standard and safeguarded augmented Lagrangian methods

0 references

Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

0 references

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

0 references

An augmented Lagrangian approach for sparse principal component analysis

0 references

Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization

0 references

An augmented Lagrangian interior-point method using directions of negative curvature

0 references

Q4324980

0 references

Cubic regularization of Newton method and its global performance

0 references

A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees

0 references

A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization

0 references

Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization

0 references

An interior-point algorithm for nonconvex nonlinear programming

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

Sparse Reconstruction by Separable Approximation

0 references

Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Identifiers

DOI

10.1007/s10589-024-00603-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6642793