An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
From MaRDI portal
Recommendations
- Sparse Optimization with Least-Squares Constraints
- scientific article; zbMATH DE number 640536
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- scientific article; zbMATH DE number 1735435
- A semismooth Newton method with multidimensional filter globalization for l₁-optimization
Cites work
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A further result on an implicit function theorem for locally Lipschitz functions
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Computer algebra recipes. A gourmet's guide to the mathematical models of science. Incl. 1 CD-ROM
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Convex Analysis
- Exact Regularization of Convex Programs
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- 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 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Level-set methods for convex optimization
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- On almost smooth functions and piecewise smooth functions
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On Q-order and R-order of convergence
- Optimization and nonsmooth analysis
- Probing the Pareto frontier for basis pursuit solutions
- Secant methods for semismooth equations
- Semismooth Matrix-Valued Functions
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
- Sparse Optimization with Least-Squares Constraints
- Sparsity and Smoothness Via the Fused Lasso
- Tame functions are semismooth
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
This page was built for publication: An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561379)
