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.
- Semi-infinite programming and applications to minimax problems (Q1417774) (← links)
- Robot trajectory planning with semi-infinite programming. (Q1420386) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- On optimality conditions for generalized semi-infinite programming problems (Q1579665) (← links)
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions (Q1591926) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential (Q1693844) (← links)
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach (Q1695816) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations (Q1725116) (← links)
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- Extremal bootstrapping: go with the flow (Q1750983) (← links)
- Discretization method for semi-definite programming (Q1770709) (← links)
- A new proof of the strong duality theorem for semidefinite programming (Q1771002) (← links)
- Bilevel decision with generalized semi-infinite optimization for fuzzy mappings as lower level problems (Q1774610) (← links)
- A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
- Duality theorems and algorithms for linear programming in measure spaces (Q1777445) (← links)
- An approximation approach to non-strictly convex quadratic semi-infinite programming (Q1777448) (← links)
- Global solution of semi-infinite programs (Q1780954) (← links)
- On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints (Q1785489) (← links)
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems (Q1787821) (← links)
- A dynamic game approach to distributionally robust safety specifications for stochastic systems (Q1797093) (← links)
- Generalized semi-infinite programming: Theory and methods (Q1806731) (← links)
- Numerical experiments in semi-infinite programming (Q1816403) (← links)
- Solving min-max problems and linear semi-infinite programs (Q1816663) (← links)
- On generalized semi-infinite optimization and bilevel optimization (Q1847253) (← links)
- An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions. (Q1848898) (← links)
- On Nesterov's approach to semi-infinite programming (Q1862263) (← links)
- Testing of monotonicity in parametric regression models (Q1866206) (← links)
- An approximation of feasible sets in semi-infinite optimization. (Q1871423) (← links)
- Solving a class of fuzzy linear programs by using semi-infinite programming techniques (Q1885701) (← links)
- Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
- Parametric linear semi-infinite programming (Q1921197) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm (Q1921211) (← links)
- A globally convergent method for semi-infinite linear programming (Q1924071) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- On saddle points in nonconvex semi-infinite programming (Q1928307) (← links)
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions (Q1945966) (← links)
- An augmented Lagrangian algorithm for solving semiinfinite programming (Q1952762) (← links)
- Design of 2D linear phase DFT modulated filter banks using bi-iterative second-order cone program (Q1957901) (← links)
- A dual parametrization approach to Nyquist filter design (Q1957912) (← links)
- A perturbation method for solving linear semi-infinite programming problems (Q1962976) (← links)
- Linear programming with fuzzy coefficients in constraints (Q1963043) (← links)
