On approximations with finite precision in bundle methods for nonsmooth optimization
From MaRDI portal
Recommendations
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Approximations in proximal bundle methods and decomposition of convex programs
- A proximal bundle method based on approximate subgradients
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 686906 (Why is no real title available?)
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A family of variable metric proximal methods
- A proximal bundle method based on approximate subgradients
- Approximations in proximal bundle methods and decomposition of convex programs
- Convergence analysis of perturbed feasible descent methods
- Error stability properties of generalized gradient-type algorithms
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Lagrangian decomposition and nonsmooth optimization: bundle algorithm, prox iteration, augmented Lagrangian
- Methods of descent for nondifferentiable optimization
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(29)- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
- Incremental-like bundle methods with application to energy planning
- Uncontrolled inexact information within bundle methods
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- A decomposition algorithm for convex nondifferentiable minimization with errors
- A simple version of bundle method with linear programming
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces
- Benders decomposition with adaptive oracles for large scale optimization
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Level bundle methods for oracles with on-demand accuracy
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- An approximate bundle method for solving nonsmooth equilibrium problems
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Optimal Convergence Rates for the Proximal Bundle Method
- A proximal bundle method based on approximate subgradients
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- Dual norm based iterative methods for image restoration
- Dynamic bundle methods
- A doubly stabilized bundle method for nonsmooth convex optimization
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities
- An inexact bundle variant suited to column generation
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
This page was built for publication: On approximations with finite precision in bundle methods for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597165)
