Pages that link to "Item:Q1923916"
From MaRDI portal
The following pages link to Inequality systems and global optimization (Q1923916):
Displaying 35 items.
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization (Q618891) (← links)
- Characterization of d.c. Functions in terms of quasidifferentials (Q640206) (← links)
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722) (← links)
- On robust duality for fractional programming with uncertainty data (Q743463) (← links)
- Optimization of the difference of ICR functions (Q838045) (← links)
- Some new Farkas-type results for inequality systems with DC functions (Q925237) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- Global minimization of the difference of increasing co-radiant and quasi-concave functions (Q1653284) (← links)
- Optimality conditions for semi-infinite programming problems involving generalized convexity (Q1733329) (← links)
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
- Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces (Q2116030) (← links)
- Lagrange duality in canonical DC programming (Q2258474) (← links)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- The stable duality of DC programs for composite convex functions (Q2358470) (← links)
- The strong conical hull intersection property for convex programming (Q2490330) (← links)
- An alternative formulation for a new closed cone constraint qualification (Q2492444) (← links)
- Characterizations of solution sets of convex vector minimization problems (Q2503214) (← links)
- Sequential optimality conditions for multiobjective fractional programming problems (Q2512875) (← links)
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation (Q2566244) (← links)
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints (Q2656086) (← links)
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
- Optimality Conditions for a Simple Convex Bilevel Programming Problem (Q2995267) (← links)
- Approximate optimality conditions for minimax programming problems (Q3066917) (← links)
- Knowledge-based semidefinite linear programming classifiers (Q3423589) (← links)
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS (Q3520507) (← links)
- A closedness condition and its applications to DC programs with convex constraints (Q3577846) (← links)
- Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points<sup>*</sup> (Q4239759) (← links)
- A new approach to strong duality for composite vector optimization problems (Q5009161) (← links)
- New Farkas-type constraint qualifications in convex infinite programming (Q5428420) (← links)
- A Global Approach to Nonlinearly Constrained Best Approximation (Q5462831) (← links)
- Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming (Q5857290) (← links)