A smoothing gradient method for semidefinite programs
From MaRDI portal
Cites work
- \(LDL^T\) direction interior point method for semidefinite programming
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- A feasible method for general convex low-rank SDP problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A special newton-type optimization method
- An Augmented Primal-Dual Method for Linear Conic Programs
- An Interior-Point Method for Semidefinite Programming
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Complexity of chordal conversion for sparse semidefinite programs with small treewidth
- COSMO: a conic operator splitting method for convex conic problems
- Error bounds and singularity degree in semidefinite programming
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior Point Trajectories in Semidefinite Programming
- Linear Matrix Inequalities in System and Control Theory
- Merit functions for semi-definite complementarity problems
- Non-interior continuation methods for solving semidefinite complementarity problems
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Regularization methods for semidefinite programming
- Scalable semidefinite programming
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization
- Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
This page was built for publication: A smoothing gradient method for semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391546)
