Pages that link to "Item:Q5948403"

The following pages link to A proximal bundle method based on approximate subgradients (Q5948403):

Displaying 33 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)
• An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← 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)
• 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)
• On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
• An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
• A quasi-Newton bundle method based on approximate subgradients (Q874359) (← links)
• A proximal bundle method with inexact data for convex nondifferentiable minimization (Q876907) (← links)
• An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition (Q879572) (← links)
• An approximate decomposition algorithm for convex minimization (Q966076) (← 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 cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1722320) (← links)
• A proximal analytic center cutting plane algorithm for solving variational inequality problems (Q1952872) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← 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)
• A geometric integration approach to nonsmooth, nonconvex optimisation (Q2088134) (← links)
• Revisiting augmented Lagrangian duals (Q2097636) (← links)
• An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
• Uncontrolled inexact information within bundle methods (Q2397754) (← links)
• An approximate bundle method for solving nonsmooth equilibrium problems (Q2399480) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• An alternating linearization method with inexact data for bilevel nonsmooth convex optimization (Q2438407) (← links)
• Global optimization for non-convex programs via convex proximal point method (Q2691402) (← 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)
• New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)