Abstract
Merit function approach is a popular method to deal with complementarity problems, in which the complementarity problem is recast as an unconstrained minimization via merit function or complementarity function. In this paper, for the complementarity problem associated with p-order cone, which is a type of nonsymmetric cone complementarity problem, we show the readers how to construct merit functions for solving p-order cone complementarity problem. In addition, we study the conditions under which the level sets of the corresponding merit functions are bounded, and we also assert that these merit functions provide an error bound for the p-order cone complementarity problem. These results build up a theoretical basis for the merit method for solving p-order cone complementarity problem.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Chen, J.-S.: A new merit function and its related properties for the second-order cone complementarity problem. Pac. J. Optim. 2, 167–179 (2006)
Chen, J.-S.: Two classes of merit functions for the second-order cone complementarity problem. Math. Methods Oper. Res. 64, 495–519 (2006)
Chen, J.-S.: Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem. J. Optim. Theory Appl. 135, 459–473 (2007)
Chen, X.D., Sun, D., Sun, J.: Complementarity functions and numerical experiments on some smoothing Newton methods for second-order cone complementarity problems. Comput. Optim. Appl. 25, 39–56 (2003)
Chen, J.-S., Tseng, P.: An unconstrained smooth minimization reformulation of second-order cone complementarity problem. Math. Program. 104, 293–327 (2005)
Chen, J.-S., Pan, S.-H.: A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs. Pac. J. Optim. 8, 33–74 (2012)
Fukushima, M., Luo, Z.-Q., Tseng, P.: Smoothing functions for second- order-cone complimentarity problems. SIAM J. Optim. 12, 436–460 (2002)
Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, New York (2003)
Han, D.R.: On the coerciveness of some merit functions for complimentarity problems over symmetric cones. J. Math. Anal. Appl. 336, 727–737 (2007)
Kong, L., Sun, J., Xiu, N.: A regularized smoothing Newton method for symmetric cone complementarity problems. SIAM J. Optim. 19, 1028–1047 (2008)
Kong, L., Tuncel, T., Xiu, N.: Vector-valued implicit Lagrangian for symmetric cone complementarity problems. Asia-Pac. J. Oper. Res. 26, 199–233 (2009)
Lu, N., Huang, Z.-H.: Three classes of merit functions for the complementarity problem over a closed convex cone. Optimization 62, 545–560 (2013)
Mangasarian, O.L., Solodov, M.V.: Nonlinear complementarity as unconstrained and constrained minimization. Math Program 62, 277–297 (1993)
Matsukawa, Y., Yoshise, A.: A primal barrier function Phase I algorithm for nonsymmetric conic optimization problems. Jpn. J. Ind. Appl. Math. 29, 499–517 (2012)
Miao, X.-H., Chen, J.-S.: Characterizations of solution sets of cone-constrained convex programming problems. Optim. Lett. 9, 1433–1445 (2015)
Miao, X.-H., Guo, S.-J., Qi, N., Chen, J.-S.: Constructions of complementarity functions and merit functions for circular cone complementarity problem. Comput. Optim. Appl. 63, 495–522 (2016)
Miao, X.H., Qi, N., Chen, J.-S.: Projection formula and one type of spectral factorization associated with \(p\)-order cone, to appear in Journal of Nonlinear and Convex Analysis, (2016)
Pan, S.-H., Chen, J.-S.: A one-parametric class of merit functions for the symmetric cone complementarity problem. J. Math. Anal. Appl. 355, 195–215 (2009)
Skajaa, A., Ye, Y.: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Program. 150, 391–422 (2015)
Sun, D., Sun, J.: Löwner’s operator and spectral functions in Euclidean Jordan algebras. Math. Oper. Res. 33, 421–445 (2008)
Tseng, P.: Merit functions for semi-definite complementarity problems. Math. Program. 83, 159–185 (1998)
Xue, G.-L., Ye, Y.-Y.: An efficient algorithm for minimizing a sum of \(p\)-norm. SIAM J. Optim. 10, 551–579 (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
X.-H. Miao: The author’s work is supported by National Natural Science Foundation of China (No. 11471241).
J.-S. Chen: The author’s work is supported by Ministry of Science and Technology, Taiwan.
Rights and permissions
About this article
Cite this article
Miao, XH., Chang, YL. & Chen, JS. On merit functions for p-order cone complementarity problem. Comput Optim Appl 67, 155–173 (2017). https://doi.org/10.1007/s10589-016-9889-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-016-9889-y