Dual spectral projected gradient method for generalized log-det semidefinite programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- A New Active Set Algorithm for Box Constrained Optimization
- A dual spectral projected gradient method for log-determinant semidefinite problems
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- An extension of the standard polynomial-time primal-dual path-following algorithm to the weighted determination maximization problem with semidefinite contstraints
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Consistency of the group Lasso and multiple kernel learning
- Determinant Maximization with Linear Matrix Inequality Constraints
- Model Selection and Estimation in Regression with Grouped Variables
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On how to solve large-scale log-determinant optimization problems
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
- QUIC: quadratic approximation for sparse inverse covariance estimation
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- Two-Point Step Size Gradient Methods
This page was built for publication: Dual spectral projected gradient method for generalized log-det semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850179)
