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

dualityLipschitz optimisationouter approximation methodquasi-biconjugate functionsquasi-conjugate functionquasi-convexity

Mathematics Subject Classification ID

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

Review text

This paper deals with a Lipschitz optimization problem (LOP) constrained by linear functions in \(\mathbb R^{n}\) which is one of the most important problems in global optimization. The Lipschitz optimization problem is transformed into a certain problem (MP) constrained by a ball in \(\mathbb R^{n+1}\). Besides, for (MP), the authors define the dual problem (DP) and the bidual problem (BDP) by applying the quasi-conjugate and quasi-biconjugate functions defined by \textit{P. T. Thach} [J. Math. Anal. Appl. 159, No. 2, 299--322 (1991; Zbl 0734.90073)]. By the properties of quasi-conjugation, the objective functions of (DP) and (BDP) are quasi-convex. Despite there is no guarantee that the objective function of (MP) is quasi-convex, the authors prove that each optimal value of (MP) and (DP) coincides with the multiplication of the other by \(-1\), and that each optimal solution of them is computed by dividing the other by the square of its norm. Moreover, it is also shown that both sets of all globally optimal solutions of (MP) and (BDP) coincide. Furthermore, by using the quasi-convexity of the objective function of (DP), the authors propose the overestimation procedure and an outer approximation algorithm for (DP).

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

• A convex-like duality scheme for quasi-convex programs
• Duality between direct and indirect utility functions under minimal hypotheses
• 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?)
• 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)