An efficient sieving-based secant method for sparse optimization problems with least-squares constraints

Cites Work

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Sparse Optimization with Least-Squares Constraints
Probing the Pareto frontier for basis pursuit solutions
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Title not available (Why is that?)
Sparsity and Smoothness Via the Fused Lasso
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Convex Analysis
Title not available (Why is that?)
Optimization and nonsmooth analysis
Title not available (Why is that?)
Finite-Dimensional Variational Inequalities and Complementarity Problems
Title not available (Why is that?)
Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
Secant methods for semismooth equations
Semismooth Matrix-Valued Functions
Exact Regularization of Convex Programs
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
On almost smooth functions and piecewise smooth functions
A further result on an implicit function theorem for locally Lipschitz functions
Level-set methods for convex optimization
On Q-order and R-order of convergence
Tame functions are semismooth
Newton and quasi-Newton methods for normal maps with polyhedral sets
A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
Computer algebra recipes. A gourmet's guide to the mathematical models of science. Incl. 1 CD-ROM
On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering
An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method

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)