A dual spectral projected gradient method for log-determinant semidefinite problems
DOI10.1007/s10589-020-00166-2zbMath1433.90104arXiv1812.00523OpenAlexW2999732672WikidataQ126319000 ScholiaQ126319000MaRDI QIDQ1986103
Sunyoung Kim, Mituhiro Fukuda, Takashi Nakagaki, Makoto Yamashita
Publication date: 7 April 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.00523
dual problemcomputational efficiencydual spectral projected gradient methodslog-determinant semidefinite programs with linear constraintstheoretical convergence results
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Methods of reduced gradient type (90C52)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On how to solve large-scale log-determinant optimization problems
- A nonmonotone spectral projected gradient method for large-scale topology optimization problems
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Convex analysis and nonlinear optimization. Theory and examples.
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- Alternating direction method for covariance selection models
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
- A New Active Set Algorithm for Box Constrained Optimization
- First-Order Methods for Sparse Covariance Selection
- Two-Point Step Size Gradient Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
This page was built for publication: A dual spectral projected gradient method for log-determinant semidefinite problems
