A trust region method for solving semidefinite programs
From MaRDI portal
Publication:354640
DOI10.1007/s10589-012-9514-7zbMath1273.90146OpenAlexW2110560753MaRDI QIDQ354640
Publication date: 19 July 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9514-7
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Computing a nearest symmetric positive semidefinite matrix
- Merit functions for semi-definite complementarity problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- On the truncated conjugate gradient method
- Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- An Augmented Primal-Dual Method for Linear Conic Programs
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Trust Region Methods
- A Spectral Bundle Method for Semidefinite Programming
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- An Interior-Point Method for Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Benchmarking optimization software with performance profiles.
