Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
From MaRDI portal
Recommendations
- A local convergence property of primal-dual methods for nonlinear programming
- Local linear convergence analysis of primal-dual splitting methods
- Local convergence of a primal-dual method for degenerate nonlinear programming
- Local analysis of the feasible primal-dual interior-point method
- On the local quadratic convergence of the primal–dual augmented Lagrangian method
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- The local convergence of the Byrd-Schnabel algorithm for constrained optimization
- Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption
Cites work
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- scientific article; zbMATH DE number 1183039 (Why is no real title available?)
- scientific article; zbMATH DE number 1569003 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A local convergence property of primal-dual methods for nonlinear programming
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- A primal-dual regularized interior-point method for convex quadratic programs
- A regularized Newton method for degenerate unconstrained optimization problems
- A regularized Newton method for monotone nonlinear equations and its application
- A regularized Newton method without line search for unconstrained optimization
- A trust-region method with improved adaptive radius for systems of nonlinear equations
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- An inexact proximal regularization method for unconstrained optimization
- Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Descentwise inexact proximal algorithms for smooth optimization
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- From global to local convergence of interior methods for nonlinear optimization
- Incrementally updated gradient methods for constrained and regularized optimization
- Inexact proximal point algorithms and descent methods in optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Local path-following property of inexact interior methods in nonlinear programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Regularized Newton method for unconstrained convex optimization
- Regularized Newton methods for convex minimization problems with singular solutions
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Self-adaptive inexact proximal point methods
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
- Test examples for nonlinear programming codes
- Truncated regularized Newton method for convex minimizations
- Two error bounds for constrained optimization problems and their applications
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
Cited in
(1)
This page was built for publication: Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032022)
