Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation

DOI10.1016/J.JMAA.2010.12.046MaRDI QIDQ631850zbMATH OpenOpenAlexFDO

Authors Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

Publication date 14 March 2011

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmaa.2010.12.046

zbMATH Keywords

dualityquasi-convexityLipschitz optimisationouter approximation methodquasi-biconjugate functionsquasi-conjugate function

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)

Recommendations

• Conjugate dual problem for quasiconvex programming
• scientific article; zbMATH DE number 5880478
• Bounded lower subdifferentiability optimization techniques: applications
• scientific article; zbMATH DE number 1009701
• scientific article; zbMATH DE number 1941908
• Global optimization under Lipschitzian constraints
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
• On the maximization and minimization of a quasiconvex function
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• scientific article; zbMATH DE number 572079

Cites work

• scientific article; zbMATH DE number 3848919 (Why is no real title available?)
• scientific article; zbMATH DE number 3758095 (Why is no real title available?)
• scientific article; zbMATH DE number 3518555 (Why is no real title available?)
• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• scientific article; zbMATH DE number 3320765 (Why is no real title available?)
• A convex-like duality scheme for quasi-convex programs
• Duality between direct and indirect utility functions under minimal hypotheses
• On Quasi-Convex Duality
• Optimization on low rank nonconvex structures
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• Quasiconvex duality theory by generalized conjugation methods
• Surrogate Mathematical Programming

Cited in

(1)

• On coderivatives and Lipschitzian properties of the dual pair in optimization

This page was built for publication: Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631850)