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

DOI10.1016/j.jmaa.2010.12.046zbMath1228.90119OpenAlexW2050712423MaRDI QIDQ631850

Tetsuzo Tanino, Syuuji Yamada, Tamaki Tanaka

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

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

Cites Work

• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• Optimization on low rank nonconvex structures
• Duality between direct and indirect utility functions under minimal hypotheses
• A convex-like duality scheme for quasi-convex programs
• Quasiconvex duality theory by generalized conjugation methods
• Surrogate Mathematical Programming
• On Quasi-Convex Duality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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