Abstract
In this article, we present an optimality condition in the form of a generalized KKT for nonconvex scalar-minimization problems. On the basis of the optimality condition, we present a quasi-conjugate duality for nonconvex scalar-minimization and vector-minimization problems. The duality is symmetric and has zero gap.
Similar content being viewed by others
References
Anh, P.N.: A hybrid extragradient method extended to fixed point problems and equilibrium problems. Optimization 62(2), 271–283 (2013)
Bitran, G.R.: Duality for nonlinear multiple-criteria optimization problem. J. Optim. Theory Appl. 35, 367–401 (1981)
Bot, R.I., Csetnek, E.R.: An inertial Tseng’s type proximal algorithm for nonsmooth and nonconvex optimization problems. J. Optim. Theory Appl. 171(2), 600–616 (2016)
Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Progr. Ser. A 146(1–2), 459–494 (2014)
Fabian, F.B.: Radial epiderivatives and asymptotic functions in nonconvex vector optimization. SIAM J. Optim. 14(1), 284–305 (2006)
Li, Z.M., Zhan, M.H.: Optimality conditions and Lagrange duality for vector extremum problem with set constraint. J. Optim. Theory Appl. 135, 323–352 (2007)
Penot, J.P., Volle, M.: Quasi-conjugate duality. Math. Oper. Res. 15(4), 597–625 (1990)
Quoc, T.D., Anh, P.N., Muu, L.D.: Dual extragradient algorithms to equilibrium problems. J. Glob. Optim. 52, 139–159 (2012)
Rockafellar, T.: Conjugate Duality and Optimization. University of Washington, Seattle (1974)
Sawaragi, Y., Nakayama, H., Tanino, T.: Theory of Multiobjective Optimization. Academic Press, Orlando (1985)
Suzuki, S.: Duality theorems for quasiconvex programming with a reverse quasiconvex constraint. Taiwan. J. Math. 21(2), 489–503 (2017)
Suzuki, S., Kuroiwa, D.: Necessary and sufficient constraint qualification for surrogate duality. J. Optim. Theory Appl. 152(2), 366–377 (2012)
Suzuki, S., Kuroiwa, D.: Characterizations of the solution set for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential. J. Glob. Optim. 62, 431–441 (2015)
Suzuki, S., Kuroiwa, D.: Characterizations of the solution set for non-essentially quasiconvex programming. Optim. Lett. 11, 1699–1712 (2017)
Thach, P.T.: Quasiconjugate of functions, duality relationships between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint and application. J. Math. Anal. Appl. 159, 299–322 (1991)
Thach, P.T.: Global optimality criterion and duality with zero gap in nonconvex optimization. SIAM J. Math. Anal. 24, 1537–1556 (1993)
Thach, P.T.: A nonconvex duality with zero gap and applications. SIAM J. Optim. 4, 44–64 (1994)
Thach, P.T.: Symmetric duality for homogeneous multiple-objective problems. J. Optim. Theory Appl. (2011). https://doi.org/10.1007/10957-011-9822-6
Thach, P.T., Thang, T.V.: Conjugate duality for vector-maximization problems. J. Math. Anal. Appl. 1, 94–102 (2011)
Thach, P.T., Thang, T.V.: Problems with rerource allocation constraints and optimization over the efficient set. J. Glob. Optim. 58, 481–495 (2014)
Thang, T.V.: Conjugate duality and optimization over weakly efficient set. Acta Math. Vietnam. 42(2), 337–355 (2017)
Zhang, Y., He, S.: Inertial proximal alternating minimization for nonconvex and nonsmooth problems. J. Inequal. Appl. 2017(1), 212–232 (2017)
Acknowledgements
We are very grateful to two anonymous referees for their really helpful and constructive comments that helped us very much in improving the paper. This research is funded by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant Number 101.02-2019.303.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Anh, P.N., Van Thang, T. Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization. Optim Lett 14, 2021–2037 (2020). https://doi.org/10.1007/s11590-019-01523-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-019-01523-9