An Algorithm for Nonsmooth Convex Minimization With Errors
From MaRDI portal
Publication:3707271
DOI10.2307/2008055zbMATH Open0584.65034OpenAlexW4240630660MaRDI QIDQ3707271FDOQ3707271
Authors: Krzysztof C. Kiwiel 
Publication date: 1985
Full work available at URL: https://doi.org/10.2307/2008055
Recommendations
- A decomposition algorithm for convex nondifferentiable minimization with errors
- scientific article; zbMATH DE number 6867317
- Explicit and efficient error estimation for convex minimization problems
- An algorithm for non—negative least error minimal norm solutions
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- Convex optimization with computational errors
- A note on error bounds for convex and nonconvex programs
- The extragradient method for convex optimization in the presence of computational errors
- On an algorithm in nondifferential convex optimization
- On numerical estimates of errors in solving convex optimization problems
Cited In (35)
- Approximations in proximal bundle methods and decomposition of convex programs
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
- A decomposition algorithm for convex nondifferentiable minimization with errors
- An algorithm for non—negative least error minimal norm solutions
- Minimization of A Nondifferentiable Convex Function Defined not Everywhere
- A method for minimizing the sum of a convex function and a continuously differentiable function
- Minimization of a non-smooth, strongly quasi-convex function by a conditional gradient type method
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- Constrained gradient method for nonsmooth optimization problems
- An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
- A Linearization Algorithm for Nonsmooth Minimization
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- Incremental-like bundle methods with application to energy planning
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- The approximation algorithm for solving a sort of non-smooth programming
- An approximate bundle method for solving nonsmooth equilibrium problems
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Title not available (Why is that?)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- A class of algorithms for computing the minimal value of a convex functionfover[0 1]kwithin accuracy ∊, when the evaluations offare made within accuracy ∊
- Implementation of an oracle-structured bundle method for distributed optimization
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Title not available (Why is that?)
- A descent algorithm for nonsmooth convex optimization
- Title not available (Why is that?)
- A method for convex minimization based on translated first-order approximations
- Title not available (Why is that?)
- Bundle method for non-convex minimization with inexact subgradients and function values
- An aggregate subgradient method for nonsmooth and nonconvex minimization
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
- An inexact bundle variant suited to column generation
- Title not available (Why is that?)
This page was built for publication: An Algorithm for Nonsmooth Convex Minimization With Errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707271)
