Pages that link to "Item:Q3586137"
From MaRDI portal
The following pages link to Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming (Q3586137):
Displayed 48 items.
- Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization'' (Q458936) (← links)
- New glimpses on convex infinite optimization duality (Q496382) (← links)
- On a zero duality gap result in extended monotropic programming (Q620434) (← links)
- Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
- On constraint qualifications of a nonconvex inequality (Q723504) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Stable and total Fenchel duality for composed convex optimization problems (Q1617041) (← links)
- On several types of basic constraint qualifications via coderivatives for generalized equations (Q1637351) (← links)
- Some dual characterizations of Farkas-type results for fractional programming problems (Q1670547) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Approximate optimality conditions for composite convex optimization problems (Q1689064) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- A note on optimality conditions for DC programs involving composite functions (Q1722334) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
- Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
- Strong duality and optimality conditions for generalized equilibrium problems (Q2016689) (← links)
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data (Q2136884) (← links)
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps (Q2176278) (← links)
- On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
- Sequential optimality conditions for fractional optimization with applications to vector optimization (Q2260685) (← links)
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems (Q2261970) (← links)
- On set containment characterizations for sets described by set-valued maps with applications (Q2302829) (← 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)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems (Q2351175) (← links)
- Surrogate duality for robust optimization (Q2356091) (← links)
- Farkas-type results for vector-valued functions with applications (Q2363561) (← links)
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints (Q2656086) (← links)
- Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
- Optimality conditions for composite DC infinite programming problems (Q2691286) (← links)
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions (Q2970390) (← links)
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements (Q3225066) (← links)
- Some characterizations of duality for DC optimization with composite functions (Q4559389) (← links)
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces (Q4989940) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q5088817) (← links)
- Optimality conditions and total dualities for conic programming involving composite function (Q5213372) (← links)
- Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality (Q5879572) (← links)
- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings (Q5963691) (← links)
- (Q6155210) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)