On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
From MaRDI portal
Publication:868465
Recommendations
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving some large scale semidefinite programs via the conjugate residual method
- First- and second-order methods for semidefinite programming
- Solving semidefinite programs using preconditioned conjugate gradients
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
Cites work
- scientific article; zbMATH DE number 1356716 (Why is no real title available?)
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An Interior-Point Method for Semidefinite Programming
- An incomplete Cholesky factorization for dense symmetric positive definite matrices
- An independent benchmarking of SDP and SOCP solvers
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Benchmarking optimization software with performance profiles.
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- Modified barrier functions (theory and methods)
- Numerical Optimization
- PENNON: A code for convex nonlinear and semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- SDPLIB 1.2, a library of semidefinite programming test problems
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving nonconvex SDP problems of structural optimization with stability control
- Solving some large scale semidefinite programs via the conjugate residual method
Cited in
(27)- Primal-dual interior point multigrid method for topology optimization
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- A globally convergent filter-type trust region method for semidefinite programming
- New results on the application of the passification method. A survey
- SOC-monotone and SOC-convex functions vs. matrix-monotone and matrix-convex functions
- A trust region method for solving semidefinite programs
- The Legendre transformation in modern optimization
- On barrier and modified barrier multigrid methods for three-dimensional topology optimization
- PENSDP
- Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Optimality conditions and global convergence for nonlinear semidefinite programming
- A preconditioned iterative interior point approach to the conic bundle subproblem
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- PENNON: software for linear and nonlinear matrix inequalities
- Matrix relaxations in combinatorial optimization
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
- Projection Methods in Conic Optimization
- Loraine – an interior-point solver for low-rank semidefinite programming
- A proximal augmented method for semidefinite programming problems
- Solving some large scale semidefinite programs via the conjugate residual method
Describes a project that uses
Uses Software
This page was built for publication: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868465)
