Pages that link to "Item:Q597165"
From MaRDI portal
The following pages link to On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165):
Displaying 24 items.
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
- A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- A proximal bundle method with inexact data for convex nondifferentiable minimization (Q876907) (← links)
- Incremental-like bundle methods with application to energy planning (Q975362) (← links)
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities (Q1007656) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- Dual norm based iterative methods for image restoration (Q1932971) (← links)
- A proximal analytic center cutting plane algorithm for solving variational inequality problems (Q1952872) (← links)
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← links)
- Benders decomposition with adaptive oracles for large scale optimization (Q2063193) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- Uncontrolled inexact information within bundle methods (Q2397754) (← links)
- An approximate bundle method for solving nonsmooth equilibrium problems (Q2399480) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems (Q2442700) (← links)
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
- Level bundle methods for oracles with on-demand accuracy (Q2926079) (← links)
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)