On Lagrange Duality for Several Classes of Nonconvex Optimization Problems

DOI10.1007/978-3-030-21803-4_18zbMath1429.90054OpenAlexW2951765394MaRDI QIDQ5214420

Monika Syga, Ewa M. Bednarczuk

Publication date: 7 February 2020

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21803-4_18

zbMATH Keywords

nonconvex optimizationminimax theoremabstract convexityLagrangian duality\(\varPhi \)-convexityweakest constraint qualification condition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

Zero duality gap conditions via abstract convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lagrange-type duality in DC programming
• Semiconcave functions, Hamilton-Jacobi equations, and optimal control
• Duality in D. C. programming: The case of several D. C. constraints
• Minimax theorems for extended real-valued abstract convex-concave functions
• Prox-regular functions in Hilbert spaces
• The quadratic sub-Lagrangian of a prox-regular function.
• Minimax theorems for Ф-convex functions: sufficient and necessary conditions
• Strong and Weak Convexity of Sets and Functions
• On difference convexity of locally Lipschitz functions
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
• On $\Phi $-Convexity in Extremal Problems
• Variational Analysis
• Some characterizations of duality for DC optimization with composite functions
• On minimax theorems for lower semicontinuous functions in Hilbert spaces
• Abstract convexity and global optimization

This page was built for publication: On Lagrange Duality for Several Classes of Nonconvex Optimization Problems