Pages that link to "Item:Q484139"

The following pages link to Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139):

Displaying 50 items.

• A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
• Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
• A characterization of the subdifferential of singular Gaussian distribution functions (Q494871) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
• A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
• Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
• An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← links)
• Generalisations, examples, and counter-examples in analysis and optimisation. \textit{In honour of Michel Théra at 70} (Q1679584) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
• Target radius methods for nonsmooth convex optimization (Q1728379) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
• Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system (Q1789576) (← links)
• Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
• Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
• Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley (Q2030657) (← links)
• Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization (Q2030665) (← links)
• A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
• Revisiting augmented Lagrangian duals (Q2097636) (← links)
• A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
• Alternating forward-backward splitting for linearly constrained optimization problems (Q2191282) (← links)
• A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming (Q2230935) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Uncontrolled inexact information within bundle methods (Q2397754) (← links)
• A comparison of four approaches from stochastic programming for large-scale unit-commitment (Q2397759) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
• A simple version of bundle method with linear programming (Q2419511) (← links)
• Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
• Prices stabilization for inexact unit-commitment problems (Q2636928) (← links)
• A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
• Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
• Level bundle methods for oracles with on-demand accuracy (Q2926079) (← links)
• Incremental Bundle Methods using Upper Models (Q4603045) (← links)
• A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
• A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
• (Q5037959) (← links)
• A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
• Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space (Q5193505) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• An Inner-Outer Approximation Approach to Chance Constrained Optimization (Q5355201) (← links)
• Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)