The following pages link to Semi-infinite programming (Q869581):
Displaying 50 items.
- Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem (Q1794864) (← links)
- A dynamic game approach to distributionally robust safety specifications for stochastic systems (Q1797093) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- On Nesterov's approach to semi-infinite programming (Q1862263) (← links)
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
- Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions (Q1945966) (← 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)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- Ergodic approach to robust optimization and infinite programming problems (Q2045190) (← links)
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints (Q2046540) (← links)
- Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus (Q2047258) (← 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)
- Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem (Q2115320) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
- A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard (Q2154354) (← links)
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
- Frameworks and results in distributionally robust optimization (Q2165596) (← links)
- On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints (Q2168046) (← 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)
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints (Q2168778) (← links)
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications (Q2178574) (← links)
- Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
- Marco A. López, a pioneer of continuous optimization in Spain (Q2189625) (← 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)
- 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)
- Optimality and duality for multiobjective semi-infinite variational problem using higher-order B-type I functions (Q2240109) (← links)
- Multiobjective DC programs with infinite convex constraints (Q2249821) (← 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)
- 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)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- A new complementarity function and applications in stochastic second-order cone complementarity problems (Q2314060) (← links)
- Pareto solutions in multicriteria optimization under uncertainty (Q2333011) (← links)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity (Q2341603) (← links)
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms (Q2353979) (← links)
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
- Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming (Q2406534) (← links)
- Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
