scientific article
From MaRDI portal
Publication:3425534
zbMath1137.90684MaRDI QIDQ3425534
No author found.
Publication date: 26 February 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality ⋮ Weaker conditions for subdifferential calculus of convex functions ⋮ Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems ⋮ On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ A note on the radius of robust feasibility for uncertain convex programs ⋮ A unifying approach to robust convex infinite optimization duality ⋮ Radius of robust global error bound for piecewise linear inequality systems ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ DC optimization approach to metric regularity of convex multifunctions with applications to infinite systems ⋮ Multiobjective optimization with least constraint violation: optimality conditions and exact penalization ⋮ Stability in linear optimization and related topics. A personal tour ⋮ Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian ⋮ On coderivatives and Lipschitzian properties of the dual pair in optimization ⋮ Complete characterizations of stable Farkas' lemma and cone-convex programming duality ⋮ New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces ⋮ Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings ⋮ Farkas' lemma in random locally convex modules and Minkowski-Weyl type results in \(L^0(\mathcal F,R^n)\) ⋮ New glimpses on convex infinite optimization duality ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ Revisiting some rules of convex analysis ⋮ On strong and total Lagrange duality for convex optimization problems ⋮ Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities ⋮ Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Subdifferential of the supremum via compactification of the index set ⋮ Optimality and duality for robust multiobjective optimization problems ⋮ Farkas' lemma for separable sublinear inequalities without qualifications ⋮ Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ New Farkas-type results for vector-valued functions: a non-abstract approach ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
This page was built for publication:
