An accelerated central cutting plane algorithm for linear semi-infinite programming
From MaRDI portal
Recommendations
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A cutting-plane method for quadratic semi infinite programming problems
- A one-phase algorithm for semi-infinite linear programming
- scientific article; zbMATH DE number 3984967
- Analytic center based cutting plane method for linear semi-infinite programming.
Cites work
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 1186927 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 799226 (Why is no real title available?)
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A central cutting plane algorithm for the convex programming problem
- A logarithmic barrier cutting plane method for convex programming
- A one-phase algorithm for semi-infinite linear programming
- A purification algorithm for semi-infinite programming
- Design of optimal linear phase FIR filters by a semi-infinite programming technique
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Methods for global prior robustness under generalized moment conditions
Cited in
(24)- A ladder method for linear semi-infinite programming
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
- Chebyshev center based column generation
- An exchange method with refined subproblems for convex semi-infinite programming problems
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- An inexact primal-dual algorithm for semi-infinite programming
- Recent contributions to linear semi-infinite optimization: an update
- A relaxation method for solving systems with infinitely many linear inequalities
- scientific article; zbMATH DE number 3984967 (Why is no real title available?)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- On solving a class of linear semi-infinite programming by SDP method
- Generalized moment theory and Bayesian robustness analysis for hierarchical mixture models
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
- Recent contributions to linear semi-infinite optimization
- A one-phase algorithm for semi-infinite linear programming
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- Analytic center based cutting plane method for linear semi-infinite programming.
- Shape constrained risk-neutral density estimation by support vector regression
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Numerical treatment of Bayesian robustness problems
- Solving a continuous local access network design problem with a stabilized central column generation approach
- Non-convex semi-infinite min-max optimization with noncompact sets
This page was built for publication: An accelerated central cutting plane algorithm for linear semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764241)
