Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y. Ye, E. Tse (1989)
An extension of Karmarkar's projective algorithm for convex quadratic programmingMathematical Programming, 44
R. Bland, D. Goldfarb, M. Todd (1981)
Feature Article - The Ellipsoid Method: A SurveyOper. Res., 29
N. Thoai, H. Tuy (1980)
Convergent Algorithms for Minimizing a Concave FunctionMath. Oper. Res., 5
M. Padberg, G. Rinaldi (1991)
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Rev., 33
N. Karmarkar (1990)
An Interior-Point Approach to NP-Complete Problems
M.R. Garey, D.S. Johnson (1980)
Computers and Intractability
K. Murty, S. Kabadi (1987)
Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 39
A. Schrijver (1986)
Theory of Linear and Integer Programming
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,''
M. Grötschel, L. Lovász, A. Schrijver (1988)
Geometric Algorithms and Combinatorial Optimization, 2
R. Bland, D. Goldfarb, M. Todd (1980)
The Ellipsoid Method: A Survey
室 章治郎 (1980)
Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979, 21
R.T. Rockafellar (1969)
Convex Analysis
Paul Kough (1979)
The Indefinite Quadratic Programming ProblemOper. Res., 27
L.G. Khachiyan (1979)
A Polynomial Algorithm for Linear ProgrammingDoklady Akad. Nauk USSR, 244
N. Karmarkar (1984)
A new polynomial-time algorithm for linear programmingCombinatorica, 4
Kâscku Yosida (1971)
Functional Analysis
This paper indicates the possible difficulties for applying the interior point method to NP-complete problems, transforms an NP-complete problem into a nonconvex quadratic program and then develops some convexity theories for it. Lastly it proposes an algorithm which uses Karmarkar's algorithm as a subroutine. The finite convergence of this algorithm is also proved.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 13, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.