A parallel algorithm for constrained concave quadratic global minimization-Reference-Cited by-同舟云学术

A parallel algorithm for constrained concave quadratic global minimization

Published:1988-04 Issue:1-3 Volume:42 Page:421-448
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Phillips A. T.,Rosen J. B.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01589415.pdf

Reference15 articles.

1. V. Chvátal,Linear Programming (W.H. Freeman and Company, New York, 1983).

2. J.E. Falk and K.R. Hoffman, “A successive underestimation method for concave minimization problems,”Mathematics of Operations Research 1(3) (1976) 251–259.

3. D.H. Glinsman and J.B. Rosen, “Constrained concave quadratic global minimization by integer programming, “Technical Report 86-37, Computer Science Department, University of Minnesota, Minneapolis, MN (1986).

4. R. Horst, “An algorithm for nonconvex programming problems,”Mathematical Programming 10 (1976) 312–321.

5. B. Kalantari, “Large scale global minimization of linearly constrained concave quadratic functions and related problems,” Ph.D. diss., University of Minnesota, Minneapolis, MN (1984).

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds;Quantum;2024-03-13

2. Convex Analysis and Global Optimization;Springer Optimization and Its Applications;2016

3. Nonconvex Quadratic Programming;Springer Optimization and Its Applications;2016

4. A new bound-and-reduce approach of nonconvex quadratic programming problems;Applied Mathematics and Computation;2015-01

5. Convex and concave relaxations of implicit functions;Optimization Methods and Software;2014-06-17