An interior point-proximal method of multipliers for convex quadratic programming
From MaRDI portal
Publication:2028483
DOI10.1007/s10589-020-00240-9zbMath1469.90158arXiv1904.10369OpenAlexW3100929843MaRDI QIDQ2028483
Jacek Gondzio, Spyridon Pougkakiotis
Publication date: 1 June 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.10369
convex quadratic programminginterior point methodsproximal point methodsregularized primal-dual methods
Related Items
Sparse Approximations with Interior Point Methods, Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy, General-purpose preconditioning for regularized interior point methods, Generation matrix: an embeddable matrix representation for hierarchical trees, IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming, On the stationarity for nonlinear optimization problems with polyhedral constraints, Combined Newton-gradient method for constrained root-finding in chemical reaction networks, Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques, Bregman primal-dual first-order method and application to sparse semidefinite programming, An interior point-proximal method of multipliers for linear positive semi-definite programming, Block preconditioners for linear systems in interior point methods for convex constrained optimization, On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual augmented Lagrangian
- Interior point methods 25 years later
- A primal-dual infeasible-interior-point algorithm for linear programming
- Proximal minimization algorithm with \(D\)-functions
- Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
- Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- A primal-dual regularized interior-point method for convex quadratic programs
- Multiple centrality corrections in a primal-dual method for linear programming
- Some properties of generalized proximal point methods for quadratic and linear programming
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
- Multiplier and gradient methods
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
- New Proximal Point Algorithms for Convex Minimization
- On the Implementation of a Primal-Dual Interior Point Method
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- A repository of convex quadratic programming problems
- A Regularized Factorization-Free Method for Equality-Constrained Optimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Symmetric Quasidefinite Matrices
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Benchmarking optimization software with performance profiles.
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
