A primal-dual regularized interior-point method for convex quadratic programs
From MaRDI portal
Publication:1762462
DOI10.1007/s12532-012-0035-2zbMath1279.90193OpenAlexW2033477411MaRDI QIDQ1762462
Michael P. Friedlander, Dominique Orban
Publication date: 27 November 2012
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-012-0035-2
Computational methods for sparse matrices (65F50) Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51)
Related Items
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods, Linear programming with nonparametric penalty programs and iterated thresholding, A regularized interior-point method for constrained linear least squares, GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems, A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, Sparse block factorization of saddle point matrices, Sparse Approximations with Interior Point Methods, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, A globally convergent regularized interior point method for constrained optimization, On the update of constraint preconditioners for regularized KKT systems, A comparison of reduced and unreduced KKT systems arising from interior point methods, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, General-purpose preconditioning for regularized interior point methods, Convergence of a stabilized SQP method for equality constrained optimization, Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming, An interior point method for nonlinear optimization with a quasi-tangential subproblem, Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods, A regularization method for constrained nonlinear least squares, Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods, On second-order conic programming duals for robust convex quadratic optimization problems, A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming, Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques, Interior point methods 25 years later, A Regularized Factorization-Free Method for Equality-Constrained Optimization, An adaptively regularized sequential quadratic programming method for equality constrained optimization, Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization, A dual gradient-projection method for large-scale strictly convex quadratic problems, An interior point-proximal method of multipliers for convex quadratic programming, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization, Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines, Design and implementation of a modular interior-point solver for linear optimization, Quasi-Newton approaches to interior point methods for quadratic problems, Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems, An exterior point polynomial-time algorithm for convex quadratic programming, From global to local convergence of interior methods for nonlinear optimization, A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization, A primal–dual regularized interior-point method for semidefinite programming, On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementing proximal point methods for linear programming
- HOPDM - a higher order primal-dual method for large scale linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Interior proximal point algorithm for linear programs
- Interior dual proximal point algorithm for linear programs
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Solution of sparse rectangular systems using LSQR and Craig
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
- The multiplier method of Hestenes and Powell applied to convex programming
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- Exact Regularization of Convex Programs
- Nonlinear Perturbation of Linear Programs
- On the Implementation of a Primal-Dual Interior Point Method
- A Preconditioned Iterative Method for Saddlepoint Problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Commentary—Interior-Point Methods: Algorithms and Formulations
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- On free variables in interior point methods
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- A repository of convex quadratic programming problems
- Symmetric Quasidefinite Matrices
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- Object-oriented software for quadratic programming
- CUTEr and SifDec
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
