Inequality systems and global optimization
From MaRDI portal
Publication:1923916
DOI10.1006/jmaa.1996.0353zbMath0856.90128OpenAlexW2037005512MaRDI QIDQ1923916
Publication date: 3 February 1997
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1996.0353
difference of convex functionsFarkas' lemmaepigraphsinfinite inequality systemscone convex inequality systemssolvability results
Related Items
The stable duality of DC programs for composite convex functions ⋮ Optimization of the difference of ICR functions ⋮ Global minimization of the difference of increasing co-radiant and quasi-concave functions ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ Constraint qualifications characterizing Lagrangian duality in convex optimization ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ Complete characterizations of stable Farkas' lemma and cone-convex programming duality ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Lagrange duality in canonical DC programming ⋮ The strong conical hull intersection property for convex programming ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Approximate optimality conditions for minimax programming problems ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ On robust duality for fractional programming with uncertainty data ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Knowledge-based semidefinite linear programming classifiers ⋮ A new approach to strong duality for composite vector optimization problems ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points* ⋮ Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
