Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems

DOI10.1007/s10898-011-9794-yzbMath1269.90084OpenAlexW2056573077MaRDI QIDQ1928273

Yalçın Küçük, İlknur Atasever, Küçük, Mahide

Publication date: 3 January 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9794-y

zbMATH Keywords

nonsmooth analysisnonconvex optimizationnonconvex analysisweak subdifferentialslower Lipschitz functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items (4)

Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ Unnamed Item ⋮ Partial order relations on family of sets and scalarizations for set optimization ⋮ Weak-subdifferentials for vector functions and applications to multiobjective semi-infinite optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• A method of duality for a mixed vector equilibrium problem
• Strong duality for generalized convex optimization problems
• Nonlinear analysis and variational problems. In Honor of George Isac
• On sufficiency of the Kuhn-Tucker conditions
• Zero duality gaps in infinite-dimensional programming
• Stability and duality of nonconvex problems via augmented Lagrangian
• Invex-convexlike functions and duality
• On the theory of Lagrangian duality
• Duality for equilibrium problems
• Extension of Fenchel's duality theorem for convex functions
• Lagrange Multipliers and Optimality
• An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
• A Nonconvex Duality with Zero Gap and Applications
• Controllability of Nonlinear Systems on Compact Manifolds
• On Conjugate Convex Functions

This page was built for publication: Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems