Pages that link to "Item:Q1764241"
From MaRDI portal
The following pages link to An accelerated central cutting plane algorithm for linear semi-infinite programming (Q1764241):
Displaying 19 items.
- A ladder method for linear semi-infinite programming (Q380573) (← links)
- Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
- A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- Generalized moment theory and Bayesian robustness analysis for hierarchical mixture models (Q870499) (← links)
- Numerical treatment of Bayesian robustness problems (Q962855) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- Shape constrained risk-neutral density estimation by support vector regression (Q1671251) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
- An exchange method with refined subproblems for convex semi-infinite programming problems (Q2829588) (← links)
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing (Q3111142) (← links)
- On solving a class of linear semi-infinite programming by SDP method (Q4981874) (← links)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
- Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming (Q5355202) (← links)