[1]
|
R. K. Ahuja and J. B. Orlin, Inverse optimization, Oper. Res., 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 flow problems, Networks, 40 (2002), 181-187.
doi: 10.1002/net.10048.
|
[3]
|
J. F. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems, Springer-Verlag, New York, 2000.
doi: 10.1007/978-1-4612-1394-9.
|
[4]
|
R. E. Burkard, Y. Lin and J. Zhang, Weight reduction problems with certain bottleneck objectives, European J. Oper. Res., 153 (2004), 191-199.
doi: 10.1016/S0377-2217(02)00713-0.
|
[5]
|
D. Burton and Ph. L. Toint, On an instance of the inverse shortest paths problem, Math. Program., 53 (1992), 45-61.
doi: 10.1007/BF01585693.
|
[6]
|
M. C. Cai, X. G. Yang and J. Zhang, The complexity analysis of the inverse center location problem, J. Glob. Optim., 15 (1999), 213-218.
doi: 10.1023/A:1008360312607.
|
[7]
|
F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley and Sons, New York, 1983.
|
[8]
|
F. Facchinei, A. Fischer and C. Kanzow, Inexact newton methods for semismooth equations with applications to variational inequality problems, in Nonlinear Optimization And Applications (eds. G. F and D. G), Plenum press, New York, (1996), 125–139.
doi: 10.1007/978-1-4899-0289-4_9.
|
[9]
|
C. Heuberger, Inverse combinatorial optimization: A survey on problems, methods and results, J. Combin. Optim., 8 (2004), 329-361.
doi: 10.1023/B:JOCO.0000038914.26975.9b.
|
[10]
|
G. Iyengar and W. Kang, Inverse conic programming with applications, Oper. Res. Lett., 33 (2005), 319-330.
doi: 10.1016/j.orl.2004.04.007.
|
[11]
|
Y. Jiang, X. Xiao, L. Zhang and J. Zhang, A perturbation approach for a type of inverse linear programming problems, Int. J. Comput. Math., 88 (2011), 508-516.
doi: 10.1080/00207160903513003.
|
[12]
|
F. Meng, D. Sun and G. Zhao, Semismoothness of solutions to generalized equations and the moreau-yosida regularization, Math. Program., 104 (2005), 561-581.
doi: 10.1007/s10107-005-0629-9.
|
[13]
|
R. T. Rockafellar and R. J. B. Wets, Variational Analysis, Springer, New York, 1998.
|
[14]
|
P. Sonneveld, Cgs, a fast lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 10 (1989), 36-52.
doi: 10.1137/0910004.
|
[15]
|
D. Sun, A Short Summer School Course on Modern Optimization Theory: Optimality Conditions and Perturbation Analysis, Part I, Part II, Part III, Technical report, National University of Singapore, Singapore, 2006.
|
[16]
|
D. Sun, The strong second order sufficient condition and constraint nondegenracy in nonlinear semidefinite programming and their implications, Math. Oper. Res, 31 (2006), 761-776.
doi: 10.1287/moor.1060.0195.
|
[17]
|
D. Sun and J. Sun, Semismooth matrix valued functions, Math. Oper. Res., 27 (2002), 150-169.
doi: 10.1287/moor.27.1.150.342.
|
[18]
|
D. Sun, J. Sun and L. Zhang, The rate of convergence of the augmented lagrangian method for nonlinear semidefinite proguamming, Math. Program., 114 (2008), 349-391.
doi: 10.1007/s10107-007-0105-9.
|
[19]
|
X. Xiao, L. Zhang and J. Zhang, A smoothing newton method for a type of inverse semi-definite quadratic programming problem, J. Comput. Appl. Math., 223 (2009), 485-498.
doi: 10.1016/j.cam.2008.01.028.
|
[20]
|
E. H. Zarantonello, Projections on convex sets in hilbert space and spectral theory: I and II,
in Contributions to Nonlinear Functional Analysis (ed. E. H. Zarantonello), Academic Press,
New York, 1971, 237-341.
|
[21]
|
J. Zhang and Z. Liu, Calculating some inverse linear programming problems, J. Comput. Appl. Math., 72 (1996), 261-273.
doi: 10.1016/0377-0427(95)00277-4.
|
[22]
|
J. Zhang and Z. Liu, A further study on inverse linear programming problems, J. Comput. Appl. Math., 106 (1999), 345-359.
doi: 10.1016/S0377-0427(99)00080-1.
|
[23]
|
J. Zhang and Z. Ma, Solution structure of some inverse combinatorial optimization problems, J. Combin. Optim., 3 (1999), 127-139.
doi: 10.1023/A:1009829525096.
|
[24]
|
J. Zhang and L. Zhang, An augmented lagrangian method for a class of inverse quadratic programming problems, Appl. Math. Optim., 61 (2010), 57-83.
doi: 10.1007/s00245-009-9075-z.
|