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

DOI10.1016/J.JMAA.2010.12.046zbMATH Open1228.90119OpenAlexW2050712423MaRDI QIDQ631850FDOQ631850

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

Recommendations

• Conjugate dual problem for quasiconvex programming
• scientific article
• 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

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)

Cites Work

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

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)