A decomposition algorithm for convex nondifferentiable minimization with errors
Summary: A decomposition algorithm based on proximal bundle-type method with inexact data is presented for minimizing an unconstrained nonsmooth convex function \(f\). At each iteration, only the approximate evaluation of \(f\) and its approximate subgradients are required which make the algorithm easier to implement. It is shown that every cluster of the sequence of iterates generated by the proposed algorithm is an exact solution of the unconstrained minimization problem. Numerical tests emphasize the theoretical findings.
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- An approximate decomposition algorithm for convex minimization
- Approximations in proximal bundle methods and decomposition of convex programs
- An Algorithm for Nonsmooth Convex Minimization With Errors
- Publication:4945773
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A proximal bundle method based on approximate subgradients
- An approximate decomposition algorithm for convex minimization
- Convergence of some algorithms 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?)
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Proximité et dualité dans un espace hilbertien
- The 𝒰-Lagrangian of a convex function
- Decomposition algorithm for convex differentiable minimization
- 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
- scientific article; zbMATH DE number 6613055 (Why is no real title available?)
- An Algorithm for Nonsmooth Convex Minimization With Errors
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- An approximate decomposition algorithm for convex minimization
This page was built for publication: A decomposition algorithm for convex nondifferentiable minimization with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410890)
