A second-order descent method with active-set prediction for group-sparse optimization

DOI10.1007/S10589-026-00774-4MaRDI QIDQ7262400zbMATH OpenFDO

Authors Juan Carlos De los Reyes, Sofía López-Ordóñez, Pedro Merino

Publication date 11 June 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-026-00774-4

zbMATH Keywords

active-set predictiondescent methodsgroup-sparse optimizationNewton methodsecond-order methods

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53)

Cites work

• A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
• A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
• A proximal method for composite minimization
• A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
• A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
• A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
• Accelerating block coordinate descent methods with identification strategies
• Adaptive FISTA for Nonconvex Optimization
• An algorithm for quadratic _1-regularized optimization with a flexible active-set strategy
• Analysis of Spatio-Temporally Sparse Optimal Control Problems of Semilinear Parabolic Equations
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
• Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
• Directional sparsity in optimal control of partial differential equations
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Efficient block-coordinate descent algorithms for the group Lasso
• Globalized inexact proximal Newton-type methods for nonconvex composite functions
• scientific article; zbMATH DE number 5703572 (Why is no real title available?)
• scientific article; zbMATH DE number 1274356 (Why is no real title available?)
• scientific article; zbMATH DE number 5937962 (Why is no real title available?)
• Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
• Introduction to nonsmooth optimization. Theory, practice and software
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Model Selection and Estimation in Regression with Grouped Variables
• Numerical Nonsmooth Optimization
• Optimal control of semilinear elliptic equations in measure spaces
• Proximal gradient methods with adaptive subspace sampling
• Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization
• The Group Lasso for Logistic Regression
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function

This page was built for publication: A second-order descent method with active-set prediction for group-sparse optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262400)