The following pages link to (Q3425534):
Displaying 43 items.
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints (Q377740) (← links)
- A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian (Q454254) (← links)
- Farkas' lemma in random locally convex modules and Minkowski-Weyl type results in \(L^0(\mathcal F,R^n)\) (Q488661) (← links)
- New glimpses on convex infinite optimization duality (Q496382) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities (Q618883) (← links)
- On coderivatives and Lipschitzian properties of the dual pair in optimization (Q654087) (← links)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Farkas' lemma for separable sublinear inequalities without qualifications (Q732779) (← links)
- Functional inequalities and theorems of the alternative involving composite functions (Q743970) (← links)
- Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems (Q849317) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces (Q929661) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- DC optimization approach to metric regularity of convex multifunctions with applications to infinite systems (Q1935274) (← links)
- Stability in linear optimization and related topics. A personal tour (Q1939064) (← links)
- Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems (Q1939070) (← links)
- Subdifferential of the supremum via compactification of the index set (Q2022436) (← links)
- Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus (Q2047258) (← links)
- Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings (Q2230938) (← links)
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems (Q2261970) (← links)
- New Farkas-type results for vector-valued functions: a non-abstract approach (Q2315254) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q2336429) (← links)
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems (Q2351175) (← links)
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions (Q2438323) (← links)
- On strong and total Lagrange duality for convex optimization problems (Q2473844) (← links)
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities (Q2474349) (← links)
- Weaker conditions for subdifferential calculus of convex functions (Q2630793) (← links)
- Radius of robust global error bound for piecewise linear inequality systems (Q2664894) (← links)
- Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality'' (Q2677659) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q5088817) (← links)
- New Farkas-type constraint qualifications in convex infinite programming (Q5428420) (← links)
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization (Q6085748) (← links)
