Pages that link to "Item:Q263188"

The following pages link to A doubly stabilized bundle method for nonsmooth convex optimization (Q263188):

Displaying 30 items.

• Composite proximal bundle method (Q359623) (← links)
• Regularized optimization methods for convex MINLP problems (Q518454) (← links)
• Bundle-type methods for inexact data (Q1574134) (← links)
• A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1722320) (← links)
• Target radius methods for nonsmooth convex optimization (Q1728379) (← links)
• Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
• Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization (Q2023658) (← links)
• Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley (Q2030657) (← links)
• Risk-averse stochastic programming and distributionally robust optimization via operator splitting (Q2070402) (← links)
• A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
• A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
• On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
• Uncontrolled inexact information within bundle methods (Q2397754) (← links)
• Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
• An approximate bundle method for non-convex optimization and its dual problem (Q2823697) (← links)
• Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
• A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
• The method of codifferential descent for convex and global piecewise affine optimization (Q5859002) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
• Minimizing oracle-structured composite functions (Q6173766) (← links)
• Stabilized Benders decomposition for energy planning under climate uncertainty (Q6586266) (← links)
• Implementation of an oracle-structured bundle method for distributed optimization (Q6640181) (← links)