A Lagrange-Newton algorithm for sparse nonlinear programming

DOI10.1007/s10107-021-01719-xzbMath1504.90164arXiv2004.13257OpenAlexW3208489956MaRDI QIDQ2089792

Chen Zhao, Ziyan Luo, Hou-Duo Qi, Nai-Hua Xiu

Publication date: 24 October 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.13257

zbMATH Keywords

Newton methodlocally quadratic convergenceapplicationLagrangian equationsparse nonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Newton-type methods (49M15)

Related Items

Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds

Uses Software

• CoSaMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On solutions of sparsity constrained optimization
• The sparse principal component analysis problem: optimality conditions and algorithms
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Manifold elastic net: a unified framework for sparse dimension reduction
• Iterative hard thresholding for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
• DC formulations and algorithms for sparse optimization problems
• Optimality conditions for sparse nonlinear programming
• Complexity of unconstrained \(L_2 - L_p\) minimization
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• An efficient optimization approach for a cardinality-constrained index tracking problem
• Optimal Cardinality Constrained Portfolio Selection
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse and Redundant Representations
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Restart procedures for the conjugate gradient method
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Gradient Pursuits
• A null-space-based weightedl₁minimization approach to compressed sensing
• Sparse Approximate Solutions to Linear Systems
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Sparse Approximation via Penalty Decomposition Methods
• Compressed sensing
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers