A decomposition algorithm for convex nondifferentiable minimization with errors
From MaRDI portal
Publication:410890
DOI10.1155/2012/215160zbMath1235.65066OpenAlexW2017502019WikidataQ58906391 ScholiaQ58906391MaRDI QIDQ410890
Li-Ping Pang, Yuan Lu, Xi-Jun Liang, Jie Shen
Publication date: 4 April 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/215160
Related Items
A decomposition method with redistributed subroutine for constrained nonconvex optimization, 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
Cites Work
- Unnamed Item
- Unnamed Item
- On approximations with finite precision in bundle methods for nonsmooth optimization
- An approximate decomposition algorithm for convex minimization
- Convergence of some algorithms for convex minimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- Monotone Operators and the Proximal Point Algorithm
- The 𝒰-Lagrangian of a convex function
- Numerical methods for nondifferentiable convex optimization
- Proximité et dualité dans un espace hilbertien
- A proximal bundle method based on approximate subgradients
