An approximate decomposition algorithm for convex minimization
From MaRDI portal
Publication:966076
DOI10.1016/j.cam.2010.01.003zbMath1190.65098OpenAlexW2003297596MaRDI QIDQ966076
Yuan Lu, Xi-Jun Liang, Li-Ping Pang, Zun-Quan Xia
Publication date: 27 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.2010.01.003
proximal bundle methodnonsmooth convex optimizationsmooth pathapproximate U-LagrangianVU-decompositionVU-theory
Related Items (6)
A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ Coincidence point theorems on metric spaces via simulation functions ⋮ The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations ⋮ A filled function method for minimizing control variation in constrained discrete-time optimal control problems ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition
- Convergence of some algorithms for convex minimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- Identifiable Surfaces in Constrained Optimization
- Monotone Operators and the Proximal Point Algorithm
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- The 𝒰-Lagrangian of a convex function
- Active Sets, Nonsmoothness, and Sensitivity
- A proximal bundle method based on approximate subgradients
This page was built for publication: An approximate decomposition algorithm for convex minimization
