Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
type: Item
instance of: scholarly article
title: Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
zbMATH Open document ID: 1470.90127
author: Paul Armand
author: Ngoc Nguyen Tran
published in: Journal of Optimization Theory and Applications
publication date: 2021-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7359290
zbMATH Keywords: primal-dual method
zbMATH Keywords: interior point method
zbMATH Keywords: regularization
zbMATH Keywords: singular solutions
zbMATH Keywords: local error bounds
zbMATH Keywords: nonlinear optimization
MaRDI profile type: Publication
full work available at URL: s10957-021-01822-1
OpenAlex ID: W3132357443
cites work: A local convergence property of primal-dual methods for nonlinear programming
cites work: Local path-following property of inexact interior methods in nonlinear programming
cites work: Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
cites work: Q3837875
cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming
cites work: Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
cites work: Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
cites work: Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
cites work: Self-adaptive inexact proximal point methods
cites work: A trust-region method with improved adaptive radius for systems of nonlinear equations
cites work: A regularized Newton method for monotone nonlinear equations and its application
cites work: Q2765625
cites work: An inexact proximal regularization method for unconstrained optimization
cites work: Regularized Newton methods for convex minimization problems with singular solutions
cites work: A regularized Newton method without line search for unconstrained optimization
cites work: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
cites work: Quadratic regularizations in an interior-point method for primal block-angular problems
cites work: A primal-dual regularized interior-point method for convex quadratic programs
cites work: Incrementally updated gradient methods for constrained and regularized optimization
cites work: Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
cites work: Descentwise inexact proximal algorithms for smooth optimization
cites work: Inexact proximal point algorithms and descent methods in optimization
cites work: Truncated regularized Newton method for convex minimizations
cites work: Regularized Newton method for unconstrained convex optimization
cites work: An inexact and nonmonotone proximal method for smooth unconstrained minimization
cites work: A regularized Newton method for degenerate unconstrained optimization problems
cites work: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
cites work: Two error bounds for constrained optimization problems and their applications
cites work: Q4762533
cites work: Q4902474
cites work: From global to local convergence of interior methods for nonlinear optimization
cites work: A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
cites work: Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
cites work: Test examples for nonlinear programming codes
DOI: 10.1007/S10957-021-01822-1
Recommended article: A local convergence property of primal-dual methods for nonlinear programming
Recommended article: Local linear convergence analysis of Primal–Dual splitting methods
Recommended article: Local convergence of a primal-dual method for degenerate nonlinear programming
Recommended article: Local analysis of the feasible primal-dual interior-point method
Recommended article: On the local quadratic convergence of the primal–dual augmented Lagrangian method
Recommended article: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
Recommended article: Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
Recommended article: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
Recommended article: The local convergence of the Byrd-Schnabel algorithm for constrained optimization
Recommended article: Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption
description: scientific article; zbMATH DE number 7359290