Convergent Algorithms for a Class of Convex Semi-infinite Programs
From MaRDI portal
Recommendations
- An efficient algorithm for - convex semi-infinite programming problems
- scientific article; zbMATH DE number 4076972
- A Convergent Procedure for Convex Programming
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- An unconstrained convex programming approach to convex semi-infinite programming
- On the convergence of a class of outer approximation algorithms for convex programs
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- scientific article; zbMATH DE number 4125201
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
Cites work
- scientific article; zbMATH DE number 3822547 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 3659282 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 589258 (Why is no real title available?)
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- A cutting-plane method for quadratic semi infinite programming problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- A new exchange method for convex semi-infinite programming
- A projected lagrangian algorithm for semi-infinite programming
- A regularized penalty method for solving convex semi-infinite programs
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An algorithm of successive minimization in convex programming
- An implementation of a discretization method for semi-infinite programming
- An interior-point method for semi-infinite programming problems
- Bi-level strategies in semi-infinite programming.
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Convex analysis and global optimization
- Discretization in semi-infinite programming: the rate of convergence
- Discretization methods for the solution of semi-infinite programming problems
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global solution of semi-infinite programs
- Global solution of semi-infinite programs with existence constraints
- Infinitely constrained optimization problems
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- New results in subdifferential calculus with applications to convex optimization
- On general minimax theorems
- Robust optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite Programming
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The Cutting-Plane Method for Solving Convex Programs
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Understanding analysis
- Variational Analysis
Cited in
(8)- Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
- Minimal time nonlinear control via semi-infinite programming
- Convergent outer approximation algorithms for solving unary programs
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- Convex semi-infinite programming algorithms with inexact separation oracles
- A global approach for generalized semi-infinite programs with polyhedral parameter sets
This page was built for publication: Convergent Algorithms for a Class of Convex Semi-infinite Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043283)
