Nonsmooth optimization method and sparsity

DOI10.1007/978-3-0348-0631-2_4MaRDI QIDQ2849373zbMATH OpenOpenAlexFDO

Authors Kazufumi Ito

Publication date 17 September 2013

Published in Control and Optimization with PDE Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-0348-0631-2_4

zbMATH Keywords

multiplier rulenonsmooth optimizationsemismooth Newton methodsparsity optimizationYosida-Moreau approximation

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27) Newton-type methods (49M15) Mixed integer programming (90C11) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Methods of quasi-Newton type (90C53)

Recommendations

• A variational approach to sparsity optimization based on Lagrange multiplier theory
• Nonsmooth sparsity constrained optimization problems: optimality conditions
• scientific article; zbMATH DE number 874651
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\)

Cited in

(3)

• On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\)
• On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
• A variational approach to sparsity optimization based on Lagrange multiplier theory

This page was built for publication: Nonsmooth optimization method and sparsity

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