The following pages link to (Q5480077):
Displaying 48 items.
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions (Q289089) (← links)
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems (Q316185) (← links)
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Farkas-type results for constrained fractional programming with DC functions (Q479261) (← links)
- On the existence of minimizers of proximity functions for split feasibility problems (Q495733) (← links)
- New strong duality results for convex programs with separable constraints (Q613429) (← links)
- On optimal allocation of risk vectors (Q661232) (← links)
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis (Q683297) (← links)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
- On constraint qualifications of a nonconvex inequality (Q723504) (← links)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs (Q849329) (← links)
- Liberating the subgradient optimality conditions from constraint qualifications (Q857800) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces (Q929661) (← links)
- The conjugate of the pointwise maximum of two convex functions revisited (Q934811) (← links)
- \(\varepsilon\)-optimality conditions for composed convex optimization problems (Q935086) (← links)
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions (Q946326) (← links)
- On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces (Q959967) (← links)
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization (Q1939075) (← links)
- \(e^{\prime }\)-convex sets and functions: properties and characterizations (Q2022429) (← links)
- Simple bilevel programming and extensions (Q2039237) (← links)
- Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions (Q2041016) (← links)
- Duality problems with second-order polyhedral discrete and differential inclusions (Q2119308) (← links)
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
- Duality for constrained robust sum optimization problems (Q2230940) (← links)
- Multiobjective DC programs with infinite convex constraints (Q2249821) (← links)
- The stable duality of DC programs for composite convex functions (Q2358470) (← links)
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions (Q2438323) (← links)
- On strong and total Lagrange duality for convex optimization problems (Q2473844) (← links)
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities (Q2474349) (← links)
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. (Q2490774) (← links)
- An alternative formulation for a new closed cone constraint qualification (Q2492444) (← links)
- Necessary and sufficient conditions for stable conjugate duality (Q2492483) (← links)
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces (Q2516052) (← links)
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation (Q2566244) (← links)
- Weaker conditions for subdifferential calculus of convex functions (Q2630793) (← links)
- Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions (Q2828339) (← links)
- Optimality Conditions for a Simple Convex Bilevel Programming Problem (Q2995267) (← links)
- (Q5083070) (← links)
- A splitting method for finding the resolvent of the sum of two maximal monotone operators (Q5090286) (← links)
- New Farkas-type constraint qualifications in convex infinite programming (Q5428420) (← links)
- On duality in convex optimization of second-order differential inclusions with periodic boundary conditions (Q5876484) (← links)
- Sequential optimality theorems for second-order cone linear fractional vector optimization problems (Q6498081) (← links)
