A majorized penalty approach to inverse linear second order cone programming problems

Shiyun Wang; Yong-Jin Liu; Yong Jiang

doi:10.3934/jimo.2014.10.965

Article Contents

2014, Volume 10, Issue 3: 965-976. Doi: 10.3934/jimo.2014.10.965

This issue Previous Article Quadratic optimization over one first-order cone Next Article A sample average approximation method based on a D-gap function for stochastic variational inequality problems

A majorized penalty approach to inverse linear second order cone programming problems

1.
School of Science, Shenyang Aerospace University, Shenyang, 110136

Received: October 2012

Revised: July 2013

Published: July 2014

Abstract Related Papers Cited by

Abstract

This paper focuses on a type of inverse linear second order cone programming (LSOCP) problems which require us to adjust the parameters in both the objective function and the constraint set of a given LSOCP problem as little as possible so that a known feasible solution becomes optimal one. This inverse problem can be formulated as a linear second order cone complementarity constrained optimization problem and is difficult to solve due to the presence of second order cone complementarity constraint. To solve this difficult problem, we first partially penalize the inverse problem and then propose the majorization approach to the penalized problem by solving a sequence of convex optimization problems with quadratic objective function and simple second order cone constraints. Numerical results demonstrate the efficiency of our approach to inverse LSOCP problems.

Keywords:

Mathematics Subject Classification: Primary: 49M30, 65K05; Secondary: 90C30.

Citation:

Related Papers

Cited by

References

[1]	R. K. Ahuja and J. B. Orlin, Inverse optimization, Operations Research, 49 (2001), 771-783.doi: 10.1287/opre.49.5.771.10607.
[2]	R. K. Ahuja and J. B. Orlin, Combinatorial algorithms for inverse network ow problems, Networks, 40 (2002), 181-187.doi: 10.1002/net.10048.
[3]	D. Burton and Ph. L. Toint, On an instance of the inverse shortest paths problem, Mathematical Programming, 53 (1992), 45-61.doi: 10.1007/BF01585693.
[4]	M. C. Cai, X. G. Yang and J. Zhang, The complexity analysis of the inverse center location problem, Journal of Global Optimization, 15 (1999), 213-218.doi: 10.1023/A:1008360312607.
[5]	X. Chen and M. Fukushima, A smoothing method for a mathematical program with P-matrix linear complementarity constraints, Computational Optimization and Applications, 27 (2004), 223-246.doi: 10.1023/B:COAP.0000013057.54647.6d.
[6]	J. de Leeuw, Applications of convex analysis to multidimensional scaling, in Recent Developments in Statistics (eds. J. R. Barra, F. Brodeau, G. Romier and B. van Cutsem) (Proc. European Meeting Statisticians, Grenoble, 1976), North-Holland, Amsterdam, 1977, 133-145.
[7]	J. de Leeuw, Convergence of the majorization method for multidimensional scaling, Journal of Classification, 5 (1988), 163-180.doi: 10.1007/BF01897162.
[8]	J. de Leeuw and W. J. Heiser, Convergence of correction matrix algorithms for multidimensional scaling, in Geometric Representations of Relational Data (eds. J. C. Lingoes, I. Borg and E. E. C. I. Roskam), Mathesis Press, 1977, 735-752.
[9]	J. de Leeuw, A Decomposition Method for Weighted Least Squares Low-Rank Approximation of Symmetric Matrices, Department of Statistics, UCLA, April, 2006. Available from: http://www.escholarship.org/uc/item/1wh197mh/.
[10]	F. Facchinei, H. Jiang and L. Qi, A smoothing method for mathematical programs with equilibrium constraints, Mathematical Programming, 85 (1999), 107-134.doi: 10.1007/s101070050048.
[11]	M. Fukushima, Z.-Q. Luo and J.-S. Pang, Globally convergent sequential quadratic programming algorithm for mathematical problems with linear complementarity constraints, Computational Optimization and Applications, 10 (1998), 5-34.doi: 10.1023/A:1018359900133.
[12]	M. Fukushima and J.-S. Pang, Convergence of a smoothing continuation method for mathematical problems with complementarity constraints, in Ill-posed Variational Problems and Regularization Techniques (eds. M. Thera and R. Tichatschke) (Trier, 1998), Lecture Notes in Economics and Mathematical Systems, 477, Springer, Berlin, (1999), 99-110.doi: 10.1007/978-3-642-45780-7_7.
[13]	Y. Gao and D. F. Sun, A majorized penalty approach for calibrating rank constrained correlation matrix problems, preprint. Available from: http://www.math.nus.edu.sg/ matsundf/.
[14]	C. Heuberger, Inverse combinatorial optimization: A survey on problems, methods and results, Journal of Combinatorial Optimization, 8 (2004), 329-361.doi: 10.1023/B:JOCO.0000038914.26975.9b.
[15]	G. Iyengar and W. Kang, Inverse conic programming with applications, Operations Research Letters, 33 (2005), 319-330.doi: 10.1016/j.orl.2004.04.007.
[16]	H. Jiang and D. Ralph, Smooth SQP methods for mathematical programs with nonlinear complementarity constraints, SIAM Journal on Optimization, 10 (2000), 779-808.doi: 10.1137/S1052623497332329.
[17]	Y. Jiang, X. T. Xiao, L. W. Zhang and J. Z. Zhang, A perturbation approach for a type of inverse linear programming problems, International Journal of Computer Mathematics, 88 (2011), 508-516.doi: 10.1080/00207160903513003.
[18]	H. A. L. Kiers, Setting up alternating least squares and iterative majorization algorithm for solving various matrix optimization problems, Computational Statistics & Data Analysis, 41 (2002), 157-170.doi: 10.1016/S0167-9473(02)00142-1.
[19]	G.-H. Lin and M. Fukushima, Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints, Journal of Optimization Theory and Applications, 118 (2003), 67-80.doi: 10.1023/A:1024787424532.
[20]	G.-H. Lin and M. Fukushima, A modified relaxation scheme for mathematical programs with complementarity constraints, Annals of Operations Research, 133 (2005), 63-84.doi: 10.1007/s10479-004-5024-z.
[21]	D. G. Luenberger, Linear and Nonlinear Programming, 2nd Edition, Kluwer Academic Publishers, Boston, MA, 2003.
[22]	Z.-Q. Luo, J.-S. Pang and D. Ralph, Mathematical Programs with Equilibrium Constraints, Cambridge University Press, Cambridge, 1996.doi: 10.1017/CBO9780511983658.
[23]	S. Scholtes and M. Stöhr, Exact penalization of mathematical programs with equilibrium constraints, SIAM Journal on Control and Optimization, 37 (1999), 617-652.doi: 10.1137/S0363012996306121.
[24]	S. Scholtes, Convergence properties of a regularization scheme for mathematical programs with complementarity constraints, SIAM Journal on Optimization, 11 (2001), 918-936.doi: 10.1137/S1052623499361233.
[25]	J. F. Sturm, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Interior point methods, Optimization and Methods Software, 11/12 (1999), 625-653.doi: 10.1080/10556789908805766.
[26]	R. H. Tütüncü, K. C. Toh and M. J. Todd, Solving semidefinite-quadratic-linear programs using SDPT3, Mathematical Programming, 95 (2003), 189-217.doi: 10.1007/s10107-002-0347-5.
[27]	X. T. Xiao, L. W. Zhang and J. Z. Zhang, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, Journal of Computational and Applied Mathematics, 223 (2009), 485-498.doi: 10.1016/j.cam.2008.01.028.
[28]	X. T. Xiao, L. W. Zhang and J. Z. Zhang, On convergence of augmented Lagrange method for inverse semi-definite quadratic programming problems, Journal of Industrial and Management Optimization, 5 (2009), 319-339.doi: 10.3934/jimo.2009.5.319.
[29]	J. Zhang and Z. Liu, Calculating some inverse linear programming problems, Journal of Computational and Applied Mathematics, 72 (1996), 261-273.doi: 10.1016/0377-0427(95)00277-4.
[30]	J. Zhang and Z. Liu, A further study on inverse linear programming problems, Journal of Computational and Applied Mathematics, 106 (1999), 345-359.doi: 10.1016/S0377-0427(99)00080-1.
[31]	J. Zhang, Z. Liu and Z. Ma, Some reverse location problems, European Journal of Operations Research, 124 (2000), 77-88.doi: 10.1016/S0377-2217(99)00122-8.
[32]	J. Zhang and Z. Ma, Solution structure of some inverse combinatorial optimization problems, Journal of Combinatorial Optimization, 3 (1999), 127-139.doi: 10.1023/A:1009829525096.
[33]	Y. Zhang, Y. Jiang, L. W. Zhang and J. Z. Zhang, A perturbation approach for an inverse linear second-order cone programming, Journal of Industrial and Management Optimization, 9 (2013), 171-189.doi: 10.3934/jimo.2013.9.171.
[34]	J. Zhang and L. W. Zhang, An augmented Lagrangian method for a type of inverse quadratic programming problems, Applied Mathematics and Optimization, 61 (2010), 57-83.doi: 10.1007/s00245-009-9075-z.
[35]	J. Zhang, L. W. Zhang and X. T. Xiao, A perturbation approach for an inverse quadratic programming problem, Mathematical Methods of Operations Research, 72 (2010), 379-404.doi: 10.1007/s00186-010-0323-4.