Nonsmooth sparsity constrained optimization problems: optimality conditions

DOI10.1007/s11590-018-1310-6zbMath1462.90150OpenAlexW2886050836MaRDI QIDQ2311196

M. Sarabadan, Nooshin Movahedian, Soghra Nobakhtian

Publication date: 10 July 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1310-6

zbMATH Keywords

normal coneoptimality conditiontangent conesparsity constrained optimizationsecond-order tangent setN-stationary

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Sparsity constrained optimization problems via disjunctive programming

Uses Software

• SPGL1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On solutions of sparsity constrained optimization
• On the functions with pseudoconvex sublevel sets and optimality conditions
• Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
• Convex analysis and nonlinear optimization. Theory and examples
• Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
• On generalized pseudo- and quasiconvexities for nonsmooth functions
• Second-order necessary conditions for optimality in nonsmooth nonlinear programming
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Sparse Optimization with Least-Squares Constraints
• Variational Analysis
• Sparse Approximate Solutions to Linear Systems
• De-noising by soft-thresholding
• Greedy Sparsity-Constrained Optimization
• Sparse Approximation via Penalty Decomposition Methods
• Nonlinear Programming

This page was built for publication: Nonsmooth sparsity constrained optimization problems: optimality conditions