Pages that link to "Item:Q404512"
From MaRDI portal
The following pages link to Level bundle methods for constrained convex optimization with various oracles (Q404512):
Displayed 30 items.
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study (Q297279) (← links)
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
- A characterization of the subdifferential of singular Gaussian distribution functions (Q494871) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← 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)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization (Q2023658) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- Constraint generation for risk averse two-stage stochastic programs (Q2028853) (← links)
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- Second-order differentiability of probability functions (Q2361140) (← 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)
- Eventual convexity of probability constraints with elliptical distributions (Q2414898) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- Incremental Bundle Methods using Upper Models (Q4603045) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse (Q5131710) (← links)
- Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints (Q5233103) (← links)
- An Inner-Outer Approximation Approach to Chance Constrained Optimization (Q5355201) (← links)
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
- Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
- Constraint relaxation for the discrete ordered median problem (Q6081610) (← links)