This is a preview of subscription content, log in via an institution to check access.
Referencess
M. Bellare and P. Rogaway, “The complexity of approximating a non-linear program,” unpublished manuscript, IBM T.J. Watson Research Center (Yorktown Heights, NY, 1992).
M.E. Dyer, “Linear time algorithms for two- and three-variable linear programs,”SIAM Journal on Computing 13 (1984) 31–45.
G.M. Guisewite and P.M. Pardalos, “Minimum concave-cost network flow problems: Applications, complexity, and algorithms,”Annals of Operations Research 25 (1990) 75–100.
G.M. Guisewite and P.M. Pardalos, “A polynomially solvable concave network flow problem,” to appear in:Networks (1992).
C.-G. Han, P.M. Pardalos and Y. Ye, “An interior point algorithm for indefinite quadratic programming,” manuscript (1991).
D.S. Johnson, C.H. Papadimitriou and M. Yannakakis, “How easy is local search,”Journal of Computer and System Sciences 37 (1988) 79–100.
C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689.
N. Megiddo, “Linear programming in linear time when the dimension is fixed,”Journal of the ACM 31 (1984) 114–127.
N. Megiddo, “A note on the complexity of P-matrix LCP and computing an equilibrium,” Research Report RJ 6439, IBM Almaden Research Center (San Jose, CA, 1988).
J.J. Moré and S.A. Vavasis, “On the solution of concave knapsack problems,”Mathematical Programming 49 (1991) 397–411.
K.G. Murty, “Computational complexity of complementary pivot methods,”Mathematical Programming Study 7 (1978) 61–73.
K.G. Murty and S.N. Kabadi, “Some NP-complete problems in quadratic and nonlinear programming,”Mathematical Programming 39 (1987) 117–129.
C.H. Papadimitriou, “On the complexity of the parity argument and other inefficient proofs of existence,” unpublished manuscript, University of California at San Diego (La Jolla, CA, 1992).
P.M. Pardalos and G. Schnitger, “Checking local optimality in constrained quadratic programming is NP-hard,”Operations Research Letters 7 (1988) 33–45.
P.M. Pardalos and S.A. Vavasis, “Quadratic programming with one negative eigenvalue is NP-hard,”Journal of Global Optimization 1 (1991) 15–22.
É. Tardos, “A strongly polynomial algorithm to solve combinatorial linear programs,”Operations Research 34 (1986) 250–256.
J.F. Traub and H. Woźniakowski, “Complexity of linear programming,”Operations Research Letters 1 (1982) 59–62.
S.A. Vavasis,Nonlinear Optimization: Complexity Issues (Oxford University Press, Oxford, 1991).
S.A. Vavasis, “On approximation algorithms for concave quadratic programming,” in: C.A. Floudas and P. Pardalos, eds.,Recent Advances in Global Optimization (Princeton University Press, Princeton, NJ, 1992a) pp. 1–18.
S.A. Vavasis, “Approximation algorithms for indefinite quadratic programming,”Mathematical Programming (Series B) 57 (1992b) 279–311, this issue.
Rights and permissions
About this article
Cite this article
Pardalos, P.M., Vavasis, S.A. Open questions in complexity theory for numerical optimization. Mathematical Programming 57, 337–339 (1992). https://doi.org/10.1007/BF01581088
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01581088