Pages that link to "Item:Q3142767"
From MaRDI portal
The following pages link to Semi-Infinite Programming: Theory, Methods, and Applications (Q3142767):
Displaying 50 items.
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110) (← links)
- Relaxed cutting plane method for solving linear semi-infinite programming problems (Q1969533) (← links)
- On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs (Q1987416) (← links)
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion (Q2023572) (← links)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- Ergodic approach to robust optimization and infinite programming problems (Q2045190) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Distributionally robust optimization. A review on theory and applications (Q2074636) (← links)
- Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
- On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints (Q2089243) (← links)
- Near-optimal solutions of convex semi-infinite programs via targeted sampling (Q2095909) (← links)
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification (Q2105868) (← links)
- A projection approach to monotonic regression with Bernstein polynomials (Q2109296) (← links)
- A dual scheme for solving linear countable semi-infinite fractional programming problems (Q2115313) (← links)
- Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem (Q2115320) (← links)
- The maximax minimax quotient theorem (Q2116624) (← links)
- Problem-based optimal scenario generation and reduction in stochastic programming (Q2118075) (← links)
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications (Q2122022) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- Robust mechanism design and production structure for assembly systems with asymmetric cost information (Q2140210) (← links)
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
- Frameworks and results in distributionally robust optimization (Q2165596) (← links)
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
- Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
- Optimality analysis of a class of semi-infinite programming problems (Q2194121) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Robust trade-off portfolio selection (Q2218875) (← links)
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation (Q2225528) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- On the linear convergence rates of exchange and continuous methods for total variation minimization (Q2235147) (← links)
- Continuity and closedness of constraint and solution set mappings in unified parametric semi-infinite vector optimization (Q2235788) (← links)
- Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination (Q2256741) (← links)
- On a class of fuzzy parametric variational inequality controlled differential equation problems in finite dimension spaces (Q2272435) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Derivative-free robust optimization by outer approximations (Q2288189) (← links)
- Backward-forward reachable set splitting for state-constrained differential games (Q2288607) (← links)
- Multi-kernel unmixing and super-resolution using the modified matrix pencil method (Q2291571) (← links)
- Exact relaxations for parametric robust linear optimization problems (Q2294277) (← links)
- A model of distributionally robust two-stage stochastic convex programming with linear recourse (Q2295314) (← links)
- On sparse beamformer design with reverberation (Q2295315) (← links)
- Multiple kernel dimensionality reduction via ratio-trace and marginal Fisher analysis (Q2298714) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
