A superlinear space decomposition algorithm for constrained nonsmooth convex program

DOI10.1016/J.CAM.2009.12.018MaRDI QIDQ964944zbMATH OpenOpenAlexFDO

Authors Yuan Lu, Li-Ping Pang, Fangfang Guo, Zun-Quan Xia

Publication date 21 April 2010

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2009.12.018

zbMATH Keywords

\(\mathcal {VU}\) decompositionconvex optimizationlocal superlinear convergencenonsmooth optimizationnumerical examplespiecewise \(C^{2}\)primal-dual gradient structuresecond-order expansion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• A superlinear \(\mathcal{VU}\) space-decomposition algorithm for semi-infinite constrained programming
• A decomposition method with redistributed subroutine for constrained nonconvex optimization
• An approximate decomposition algorithm for convex minimization
• The space decomposition strategy to a class of nonconvex constrained optimization
• A variable metric method for nonsmooth convex constrained optimization

Cites work

• A \(\mathcal{VU}\)-algorithm for convex minimization
• scientific article; zbMATH DE number 1873048 (Why is no real title available?)
• scientific article; zbMATH DE number 1424528 (Why is no real title available?)
• On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
• On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
• Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
• The 𝒰-Lagrangian of a convex function
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions

Cited in

(10)

• Stochastic methods based on \(\mathcal{VU}\)-decomposition methods for stochastic convex minimax problems
• The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
• A decomposition method with redistributed subroutine for constrained nonconvex optimization
• Subdifferential enlargements and continuity properties of the \(\mathcal{VU}\)-decomposition in convex optimization
• A \(\mathcal{VU}\)-algorithm for convex minimization
• A superlinear \(\mathcal{VU}\) space-decomposition algorithm for semi-infinite constrained programming
• Identifying structure of nonsmooth convex functions by the bundle technique
• The space decomposition theory for a class of eigenvalue optimizations
• The space decomposition strategy to a class of nonconvex constrained optimization
• A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information

This page was built for publication: A superlinear space decomposition algorithm for constrained nonsmooth convex program

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