A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
From MaRDI portal
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A dual spectral projected gradient method for log-determinant semidefinite problems
- A family of spectral gradient methods for optimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A nonsmooth version of Newton's method
- A preconditioned Newton algorithm for the nearest correlation matrix
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- Alternate step gradient method*
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- An improved GLMNET for L1-regularized logistic regression
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- Benchmarking optimization software with performance profiles.
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Calibrating low-rank correlation matrix problem: an SCA-based approach
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convex Analysis
- Estimation of large block structured covariance matrices: application to `multi-omic' approaches to study seed quality
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Gradient methods with adaptive step-sizes
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- On how to solve large-scale log-determinant optimization problems
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the Accurate Identification of Active Constraints
- On the asymptotic behaviour of some new gradient methods
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the generalized low rank approximation of the correlation matrices arising in the asset portfolio
- On the solution of equality constrained quadratic programming problems arising in optimization
- Partially finite convex programming. II: Explicit lattice models
- Positive definite estimators of large covariance matrices
- Positive-definite _1-penalized estimation of large covariance matrices
- Regularized estimation of large covariance matrices
- Semismooth Matrix-Valued Functions
- Sequential Quadratic Programming with Penalization of the Displacement
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- Sparse estimation of a covariance matrix
- Sparse estimation of high-dimensional correlation matrices
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Two-Point Step Size Gradient Methods
- Weakly Differentiable Functions
Cited in
(1)
This page was built for publication: A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995703)
