Level bundle methods for constrained convex optimization with various oracles
From MaRDI portal
Publication:404512
DOI10.1007/s10589-013-9610-3zbMath1329.90109OpenAlexW1982661895MaRDI QIDQ404512
Wim van Ackooij, Welington de Oliveira
Publication date: 4 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9610-3
Related Items
Second-order differentiability of probability functions ⋮ A discussion of probability functions and constraints from a variational perspective ⋮ Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ Uncontrolled inexact information within bundle methods ⋮ A comparison of four approaches from stochastic programming for large-scale unit-commitment ⋮ Eventual convexity of probability constraints with elliptical distributions ⋮ Constraint relaxation for the discrete ordered median problem ⋮ An Inner-Outer Approximation Approach to Chance Constrained Optimization ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ Incremental Bundle Methods using Upper Models ⋮ Asynchronous level bundle methods ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse ⋮ Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment ⋮ A characterization of the subdifferential of singular Gaussian distribution functions ⋮ Regularized optimization methods for convex MINLP problems ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Proximal bundle methods for nonsmooth DC programming ⋮ Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems ⋮ Constraint generation for risk averse two-stage stochastic programs ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints ⋮ A derivative-free trust-region algorithm with copula-based models for probability maximization problems ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ A doubly stabilized bundle method for nonsmooth convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-stage stochastic optimization problems with stochastic ordering constraints on the recourse
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Validation analysis of mirror descent stochastic approximation method
- Level bundle-like algorithms for convex optimization
- A bundle-filter method for nonsmooth convex constrained optimization
- On probabilistic constraints induced by rectangular sets and multivariate normal distributions
- An inexact bundle variant suited to column generation
- Computation of multivariate normal and \(t\) probabilities
- Bundle-type methods for inexact data
- Derivatives of probability functions and some applications
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions
- Joint chance constrained programming for hydro reservoir management
- Solving two-stage stochastic programming problems with level decomposition
- An Inexact Bundle Approach to Cutting-Stock Problems
- Level bundle methods for oracles with on-demand accuracy
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- Mixed $H_2/H_\infty$ Control via Nonsmooth Optimization
- Lectures on Stochastic Programming
- A differentiation formula for integrals overseas given by inclusion
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- The Supporting Hyperplane Method for Unimodal Programming
- Convex Analysis
- Probabilistic constrained optimization. Methodology and applications
- A proximal bundle method based on approximate subgradients
