A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems (Q4606653): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(12 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NESTA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPGL1 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FPC_AS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SLEP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPNAL+ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QSDPNAL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LIBSVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.05428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level-set methods for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of second-order methods for convex \(\ell _1\)-regularized optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact successive quadratic approximation method for L-1 regularized optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Functions and Solution Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local behavior of an iterative framework for generalized equations with nonisolated solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix-free interior point method for compressed sensing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial proximal point algorithm for nuclear norm regularized matrix least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second-order method for convex<sub>1</sub>-regularized optimization with active-set prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Newton-Type Methods for Minimizing Composite Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Convergence Analysis of the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth and Semiconvex Functions in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuity properties of polyhedral multifunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth Matrix-Valued Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified primal-dual algorithm framework based on Bregman iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adaptive Lasso and Its Oracle Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization and Variable Selection Via the Elastic Net / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to error bounds for structured convex optimization problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:53, 15 July 2024

scientific article; zbMATH DE number 6848463
Language Label Description Also known as
English
A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
scientific article; zbMATH DE number 6848463

    Statements

    A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lasso
    0 references
    sparse optimization
    0 references
    augmented Lagrangian
    0 references
    metric subregularity
    0 references
    semismoothness
    0 references
    Newton's method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references