The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
From MaRDI portal
Publication:828836
DOI10.1007/s10479-020-03766-7zbMath1467.90081OpenAlexW3082459541MaRDI QIDQ828836
Bo Wei, Sixiang Zhao, William B. Haskell
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03766-7
Approximation methods and heuristics in mathematical programming (90C59) Semi-infinite programming (90C34)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Cut generation for optimization problems with multivariate risk constraints
- Optimization with a class of multivariate integral stochastic order constraints
- Sample average approximation of stochastic dominance constrained programs
- A new quadratic semi-infinite programming algorithm based on dual parametrization
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- Validation analysis of mirror descent stochastic approximation method
- An inexact primal-dual algorithm for semi-infinite programming
- Semi-infinite programming
- Optimization with multivariate stochastic dominance constraints
- A new smoothing Newton-type algorithm for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Semismooth Newton methods for solving semi-infinite programming problems
- Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Uncertain convex programs: randomized solutions and confidence levels
- A smoothing Newton method for semi-infinite programming
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- An adaptive dual parametrization algorithm for quadratic semi-infinite programming problems
- Algorithms for stochastic optimization with function or expectation constraints
- How to solve a semi-infinite optimization problem
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- Worst-case violation of sampled convex programs for optimization with uncertainty
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- An exchange method with refined subproblems for convex semi-infinite programming problems
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Primal-Dual Algorithms for Optimization with Stochastic Dominance
- Optimization with Multivariate Stochastic Dominance Constraints
- Performance Bounds for the Scenario Approach and an Extension to a Class of Non-Convex Programs
- A New Exchange Method for Convex Semi-Infinite Programming
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints
- Robust Stochastic Approximation Approach to Stochastic Programming
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Optimization with Stochastic Dominance Constraints
- From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
- Nonlinear Optimization
- Optimization with Stochastic Preferences Based on a General Class of Scalarization Functions
- Optimization with Multivariate Conditional Value-at-Risk Constraints
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- A dual parametrization method for convex semi-infinite programming
- Computational discretization algorithms for functional inequality constrained optimization
- Discretization in semi-infinite programming: the rate of convergence
This page was built for publication: The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
