A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems (Q6111345): Difference between revisions

Latest revision as of 18:33, 30 December 2024

scientific article; zbMATH DE number 7708322

Language	Label	Description	Also known as
English	A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems	scientific article; zbMATH DE number 7708322

Statements

instance of

scholarly article

0 references

title

A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems (English)

0 references

0 references

0 references

Journal of Scientific Computing

0 references

publication date

6 July 2023

0 references

full work available at URL

https://arxiv.org/abs/2111.13878

0 references

zbMATH Keywords

sparse group square-root Lasso

0 references

semismooth Newton method

0 references

augmented Lagrangian method

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Square-root lasso: pivotal recovery of sparse signals via conic programming

0 references

Q4503250

0 references

The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms

0 references

Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems

0 references

Variational analysis of the Ky Fan \(k\)-norm

0 references

Implicit Functions and Solution Mappings

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Algorithms for Fitting the Constrained Lasso

0 references

Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data

0 references

Q3813205

0 references

A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

0 references

Q5502121

0 references

Variable selection in regression with compositional covariates

0 references

Asymptotic Convergence Analysis of the Proximal Point Algorithm

0 references

Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization

0 references

On the monotonicity of the gradient of a convex function

0 references

Proximité et dualité dans un espace hilbertien

0 references

Conic optimization via operator splitting and homogeneous self-dual embedding

0 references

A nonsmooth version of Newton's method

0 references

Some continuity properties of polyhedral multifunctions

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

Variational Analysis

0 references

Linear Inversion of Band-Limited Reflection Seismograms

0 references

Regression analysis for microbiome compositional data

0 references

Sharp Oracle Inequalities for Square Root Regularization

0 references

Scaled sparse linear regression

0 references

Q4864293

0 references

Robust Regression and Lasso

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems

0 references

An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems

0 references

Identifiers

zbMATH Open document ID

1522.90108

0 references

arXiv ID

2111.13878

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10915-023-02271-W

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6111345

@@ Property / DOI @@
-.1007/s10915-023-02271-w
@@ Property / DOI: 10.1007/s10915-023-02271-w / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10915-023-02271-W
@@ Property / DOI: 10.1007/S10915-023-02271-W / rank @@
+Normal rank