Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
From MaRDI portal
Publication:2866195
DOI10.1137/120886017zbMath1286.65075arXiv1208.5960OpenAlexW2112924664MaRDI QIDQ2866195
Publication date: 13 December 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.5960
linear programmingquadratic programmingmatrix-free methodsinterior point algorithmsinexact Newton methodworst-case complexity analysis
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)
Related Items
Sparse Approximations with Interior Point Methods, Randomized Iterative Methods for Linear Systems, Local convergence analysis of inexact Newton method with relative residual error tolerance under majorant condition in Riemannian manifolds, Crash start of interior point methods, A comparison of reduced and unreduced KKT systems arising from interior point methods, Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem, Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization, On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, Stability and accuracy of inexact interior point methods for convex quadratic programming, On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach, Matrix-Free Convex Optimization Modeling, 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, An algorithm for solution of the Sylvester s‐conjugate linear equation for the commutative elliptic octonions, A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks, Interior-point solver for convex separable block-angular problems, Matrix-free interior point method for compressed sensing problems, Primal-Dual Interior Point Multigrid Method for Topology Optimization, Unnamed Item
Uses Software
