The following pages link to (Q3869074):
Displaying 50 items.
- Stability analysis for point delay fractional description models via linear matrix inequalities (Q419759) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- \(S\)-adapted equilibria in games played over event trees with coupled constraints (Q493044) (← links)
- Sufficiency and mixed type duality for multiobjective variational control problems involving \(\alpha\)-V-univexity (Q501496) (← links)
- Convex composite multi-objective nonsmooth programming (Q687035) (← links)
- Robust stability analysis and dynamic gain-scheduled controller design for point time-delay systems with parametrical uncertainties (Q718689) (← links)
- A complete algorithm for linear fractional programs (Q749455) (← links)
- Dynamic programming and inequalities (Q749457) (← links)
- Dynamic programming and penalty functions (Q749459) (← links)
- Modified Kuhn-Tucker conditions when a minimum is not attained (Q788640) (← links)
- A general Farkas lemma (Q796092) (← links)
- Inequality systems and optimization (Q811410) (← links)
- Complex minimax programming under generalized type-I functions (Q814060) (← links)
- Proper efficiency in vector infinite programming problems (Q839793) (← links)
- FJ-invex control problem (Q847289) (← links)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs (Q849329) (← links)
- Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
- Existence results and gap functions for the generalized equilibrium problem with composed functions (Q1049509) (← links)
- A generalization of a minimax theorem of Fan via a theorem of the alternative (Q1057473) (← links)
- A class of nondifferentiable continuous programming problems (Q1073721) (← links)
- Minimax principles for convex eigenvalue problems (Q1074847) (← links)
- A class of nondifferentiable control problems (Q1089903) (← links)
- Generalized fractional programming duality: A parametric approach (Q1095810) (← links)
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems (Q1101679) (← links)
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem (Q1117445) (← links)
- Some efficient algorithms for unconstrained discrete-time optimal control problems (Q1126605) (← links)
- Optimal control and invexity (Q1129515) (← links)
- Use of reference points for solving MONLP problems (Q1129974) (← links)
- A note on convex cones and constraint qualifications in infinite- dimensional vector spaces (Q1151835) (← links)
- Linear programming with matrix variables (Q1154386) (← links)
- Duality in generalized fractional programming via Farkas' lemma (Q1173019) (← links)
- Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
- Programming with semilocally convex functions (Q1206824) (← links)
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming (Q1291813) (← links)
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming (Q1315435) (← links)
- Variational inequalities with cone constraints (Q1321246) (← links)
- A Fritz John optimality condition using the approximate subdifferential (Q1333348) (← links)
- Generalized second-order characterizations of convex functions (Q1335132) (← links)
- The Lagrange approach to infinite linear programs (Q1348714) (← links)
- Eigenvalues, eigenspaces and distances to subsets (Q1356741) (← links)
- First and second-order optimality conditions for convex composite multiobjective optimization (Q1372550) (← links)
- Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
- On variational problems involving higher order derivatives (Q1767401) (← links)
- An efficient trust region method for unconstrained discrete-time optimal control problems (Q1804374) (← links)
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality (Q1807819) (← links)
- The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
- The principle and models of dynamic programming. II (Q1813173) (← links)
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes (Q1821698) (← links)
- Complex minimax programming under generalized convexity (Q1877126) (← links)
- Characterizing global optimality for DC optimization problems under convex inequality constraints (Q1924070) (← links)
