Pages that link to "Item:Q2848177"
From MaRDI portal
The following pages link to A proximal point algorithm for log-determinant optimization with group Lasso regularization (Q2848177):
Displaying 21 items.
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints (Q496623) (← links)
- Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
- A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems (Q781111) (← links)
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation (Q1796959) (← links)
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization (Q1799934) (← links)
- A dual spectral projected gradient method for log-determinant semidefinite problems (Q1986103) (← links)
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs (Q1987416) (← links)
- On the convergence analysis of the alternating direction method of multipliers with three blocks (Q2016702) (← links)
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints (Q2059164) (← links)
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge (Q2307752) (← links)
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm (Q2442634) (← links)
- Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
- An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems (Q4999369) (← links)
- A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems (Q5116554) (← links)
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold (Q5210519) (← links)
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants (Q6540011) (← links)
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem (Q6570966) (← links)
- Learning graph Laplacian with MCP (Q6640995) (← links)
