scientific article; zbMATH DE number 5042549

Regina Sandra Burachik, Vaithilingam Jeyakumar

Publication date: 25 July 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

necessary and sufficient optimality conditions

Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (47)

Duality problems with second-order polyhedral discrete and differential inclusions ⋮ The stable duality of DC programs for composite convex functions ⋮ Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions ⋮ Weaker conditions for subdifferential calculus of convex functions ⋮ A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems ⋮ Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs ⋮ Liberating the subgradient optimality conditions from constraint qualifications ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ New strong duality results for convex programs with separable constraints ⋮ Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Farkas' lemma: three decades of generalizations for mathematical 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 ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ On optimal allocation of risk vectors ⋮ The conjugate of the pointwise maximum of two convex functions revisited ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ Duality for constrained robust sum optimization problems ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ Generalized Fenchel's conjugation formulas and duality for abstract convex functions ⋮ Variational geometric approach to generalized differential and conjugate calculi in convex analysis ⋮ 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 ⋮ Multiobjective DC programs with infinite convex constraints ⋮ On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces ⋮ A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Necessary and sufficient conditions for stable conjugate duality ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ Unnamed Item ⋮ \(e^{\prime }\)-convex sets and functions: properties and characterizations ⋮ Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels ⋮ On constraint qualifications of a nonconvex inequality ⋮ Simple bilevel programming and extensions ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions ⋮ Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ On duality in convex optimization of second-order differential inclusions with periodic boundary conditions

This page was built for publication: