Pages that link to "Item:Q5470229"
From MaRDI portal
The following pages link to A Proximal Bundle Method with Approximate Subgradient Linearizations (Q5470229):
Displaying 41 items.
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator (Q276854) (← links)
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
- Incremental-like bundle methods with application to energy planning (Q975362) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← 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)
- The effect of deterministic noise in subgradient methods (Q1960191) (← links)
- Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization (Q2030665) (← 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)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
- Derivative-free optimization via proximal point methods (Q2250069) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← 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)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- Prices stabilization for inexact unit-commitment problems (Q2636928) (← links)
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems (Q2694519) (← links)
- Level bundle methods for oracles with on-demand accuracy (Q2926079) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems (Q6173956) (← links)