The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
From MaRDI portal
(Redirected from Publication:828836)
Recommendations
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A new exchange method for convex semi-infinite programming
- Stochastic algorithm for solving convex semi-infinite programming problems with equality and inequality constraints
- Solving semi-infinite programs by smoothing projected gradient method
Cites work
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3659282 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- 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
- A cutting-surface method for uncertain linear programs with polyhedral stochastic dominance constraints
- A dual parametrization method for convex semi-infinite programming
- A new exchange method for convex semi-infinite programming
- A new quadratic semi-infinite programming algorithm based on dual parametrization
- A new smoothing Newton-type algorithm for semi-infinite programming
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- A smoothing Newton method for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Algorithms for stochastic optimization with function or expectation constraints
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An adaptive dual parametrization algorithm for quadratic semi-infinite programming problems
- An exchange method with refined subproblems for convex semi-infinite programming problems
- An inexact primal-dual algorithm for semi-infinite programming
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Computational discretization algorithms for functional inequality constrained optimization
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Cut generation for optimization problems with multivariate risk constraints
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Discretization in semi-infinite programming: the rate of convergence
- From infinite to finite programs: explicit error bounds with applications to approximate dynamic programming
- How to solve a semi-infinite optimization problem
- Modern methods in the calculus of variations. L^p spaces
- Nonlinear optimization
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
- Optimization with Multivariate Conditional Value-at-Risk Constraints
- Optimization with Stochastic Dominance Constraints
- Optimization with a class of multivariate integral stochastic order constraints
- Optimization with multivariate stochastic dominance constraints
- Optimization with multivariate stochastic dominance constraints
- Optimization with stochastic preferences based on a general class of scalarization functions
- Penalty and smoothing methods for convex semi-infinite programming
- Performance Bounds for the Scenario Approach and an Extension to a Class of Non-Convex Programs
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Primal-dual algorithms for optimization with stochastic dominance
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Robust Stochastic Approximation Approach to Stochastic Programming
- Sample average approximation of stochastic dominance constrained programs
- Semi-infinite programming
- Semismooth Newton methods for solving semi-infinite programming problems
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- Uncertain convex programs: randomized solutions and confidence levels
- Validation analysis of mirror descent stochastic approximation method
- Worst-case violation of sampled convex programs for optimization with uncertainty
Cited in
(2)
This page was built for publication: The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828836)
