Pages that link to "Item:Q3192102"
From MaRDI portal
The following pages link to Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems (Q3192102):
Displaying 41 items.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Nonlinear chance constrained problems: optimality conditions, regularization and solvers (Q306384) (← links)
- Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← 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)
- A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← 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)
- 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)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- Convergence analysis on a smoothing approach to joint chance constrained programs (Q2836097) (← links)
- Incremental Bundle Methods using Upper Models (Q4603045) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← 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)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
- On the Convexity of Level-sets of Probability Functions (Q5074513) (← links)
- Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation (Q5116556) (← links)
- Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints (Q5233103) (← links)
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
- Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Probability maximization via Minkowski functionals: convex representations and tractable resolution (Q6038654) (← links)
- Robot Dance: a mathematical optimization platform for intervention against COVID-19 in a complex network (Q6114926) (← links)
- A bundle-like progressive hedging algorithm (Q6137253) (← links)
