scientific article
From MaRDI portal
Publication:3515805
zbMath1145.49016MaRDI QIDQ3515805
No author found.
Publication date: 29 July 2008
Full work available at URL: http://www.heldermann.de/JCA/JCA15/JCA152/jca15017.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Related Items
Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ On several types of basic constraint qualifications via coderivatives for generalized equations ⋮ Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Duality and Farkas-type results for extended Ky Fan inequalities with DC functions ⋮ The directional subdifferential of the difference of two convex functions ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ Stable zero Lagrange duality for DC conic programming ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems ⋮ DC approach to weakly convex optimization and nonconvex quadratic optimization problems ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Revisiting some rules of convex analysis ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ On constraint qualifications of a nonconvex inequality ⋮ Simple bilevel programming and extensions ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ Min-sup-type zero duality gap properties for DC composite optimization problem ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ Optimality conditions and duality for DC programming in locally convex spaces ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems ⋮ Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
This page was built for publication:
