Convex semi-infinite programming algorithms with inexact separation oracles
From MaRDI portal
Cites work
- A cutting-plane method for quadratic semi infinite programming problems
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- A new exchange method for convex semi-infinite programming
- A partially inexact bundle method for convex semi-infinite minmax problems
- A transformation-based discretization method for solving general semi-infinite optimization problems
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- An implementation of a discretization method for semi-infinite programming
- An Incremental Method for Solving Convex Finite Min-Max Problems
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- Convex Analysis
- Convex analysis and global optimization
- Discretization in semi-infinite programming: the rate of convergence
- Discretization methods for the solution of semi-infinite programming problems
- First-order methods of smooth convex optimization with inexact oracle
- Global optimization of semi-infinite programs via restriction of the right-hand side
- How to solve a semi-infinite optimization problem
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3822547 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Improved constraint-aggregation methods
- Infinitely constrained optimization problems
- On general minimax theorems
- On solving the Lagrangian dual of integer programs via an incremental approach
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Smooth minimization of non-smooth functions
- Smooth Optimization with Approximate Gradient
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The Cutting-Plane Method for Solving Convex Programs
- Understanding analysis
- Viability theory
Cited in
(4)- A global approach for generalized semi-infinite programs with polyhedral parameter sets
- Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
- Minimal time nonlinear control via semi-infinite programming
- Robust multistage semi-infinite programming under nested uncertainty: a hybrid decomposition approach with semidefinite relaxation
This page was built for publication: Convex semi-infinite programming algorithms with inexact separation oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968757)
