Pages that link to "Item:Q1300267"
From MaRDI portal
The following pages link to A bundle Bregman proximal method for convex nondifferentiable minimization (Q1300267):
Displaying 29 items.
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A proximal bundle method with inexact data for convex nondifferentiable minimization (Q876907) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities (Q1922692) (← links)
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems (Q2010091) (← links)
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
- A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract (Q2023991) (← links)
- A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- A proximal ADMM with the Broyden family for convex optimization problems (Q2666686) (← links)
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
- A nonmonotone proximal bundle method with (potentially) continuous step decisions (Q2866207) (← links)
- Piecewise-quadratic Approximations in Convex Numerical Optimization (Q3225237) (← links)
- (Q3412058) (← links)
- Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Implementation of an oracle-structured bundle method for distributed optimization (Q6640181) (← links)