A preconditioned iterative interior point approach to the conic bundle subproblem
From MaRDI portal
Publication:6126660
DOI10.1007/s10107-023-01986-warXiv2110.11496OpenAlexW3208239223MaRDI QIDQ6126660
Publication date: 9 April 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.11496
nonsmooth optimizationinterior point methodquadratic semidefinite programminglow rank preconditioner
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Preconditioners for iterative methods (65F08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Handbook on semidefinite, conic and polynomial optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A spectral bundle method with bounds
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Latent semantic indexing: A probabilistic analysis
- Dynamic graph generation for the shortest path problem in time expanded networks
- The spectral bundle method with second-order information
- A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions
- Matrix Analysis
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- A Spectral Bundle Method for Semidefinite Programming
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- An elementary proof of a theorem of Johnson and Lindenstrauss
- A spectral approach to bandwidth and separator problems in graphs
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Convex Analysis
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Benchmarking optimization software with performance profiles.