SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Mathematical Programming

Volumn 27, Issue 1, 1983, Pages 1-33

A numerically stable dual method for solving strictly convex quadratic programs

(2) Goldfarb, D a Idnani, A b

a Och Spine at New York Presbyterian Hospitals (United States)

b LUCENT TECHNOLOGIES (United States)

Author keywords

Dual Algorithms; Matrix Factorizations; Positive Definite Quadratic Programming; Successive Quadratic Programming Methods

Indexed keywords

QUADRATIC PROGRAMMING;

MATHEMATICAL PROGRAMMING;

EID: 0020826623 PISSN: 00255610 EISSN: 14364646 Source Type: Journal
DOI: 10.1007/BF02591962 Document Type: Article

Times cited : (742)

References (41)

1
- 0001045187
- Numerical techniques in mathematical programming
- J.B., Rosen, O.I., Mangasarian, K., Ritter, Academic Press, New York
- (1970) Nonlinear programming , pp. 123-176
- Bartels, R.H.¹ Golub, G.H.² Saunders, M.A.³

2
- 0001454852
- On minimizing a convex function subject to linear inequalities
- (1955) Journal of the Royal Statistical Society Series B , vol.17 , pp. 173-184
- Beale, E.M.L.¹

3
- 0010694516
- On quadratic programming
- (1959) Naval Research Logistics Quarterly , vol.6 , pp. 227-243
- Beale, E.M.L.¹

4
- 0001859637
- Constrained minimization using recursive quadratic programming: some alternative subproblem formulations
- L.C.W., Dixon, G.P., Szego, North-Holland, Amsterdam
- (1975) Towards global optimization , pp. 341-349
- Biggs, M.G.¹

5
- 70350340589
- Computing Science Technical Report, 61, Bell. Labs, Murray Hill. NJ
- (1977) Indefinite quadratic programming
- Bunch, J.W.¹ Kaufman, L.²

6
- 4243560701
- Department of Combinatorics and Optimization Research Report CORR 75-15, University of Waterloo, Waterloo, Ont.
- (1975) Quadratic programming via a nondifferentiable penalty function
- Conn, A.R.¹ Sinclair, J.W.²

7
- 0042455906
- Complementary pivot theory of mathematical programming
- G.B., Dantzig, A.F., Veinott, American Mathematical Society, Providence, RI
- (1968) Lectures in applied mathematics II, Mathematics of the decision sciences, Part 1 , pp. 115-136
- Cottle, R.W.¹ Dantzig, G.B.²

8
- 84966217951
- Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorizations
- (1976) Mathematics of Computation , vol.30 , pp. 772-795
- Daniel, J.W.¹ Graggs, W.B.² Kaufman, L.³ Stewart, G.W.⁴

9
- 13544253996
- Institute of Mathematics Report, The Hebrew University of Jerusalem, Jerusalem
- (1978) The gradient projection method for quadratic programming
- Dax, A.¹

10
- 0003909736
- Princeton University Press, Princeton, NJ
- (1963) Linear programming and extensions
- Dantzig, G.B.¹

11
- 84932539007
- R. Fletcher, “The calculation of feasible points for linearly constrained optimization problems”.

12
- 84932569300
- R. Fletcher, “A FORTRAN subroutine for quadratic programming”, UKAEA Research Group Report. AERE R6370 (1970).

13
- 84932513384
- R. Fletcher, “A general quadratic programming algorithm”, Journal of the Institute of Mathematics and Its Applications (1971) 76–91.

14
- 84966204836
- Methods for modifying matrix factorizations
- (1974) Mathematics of Computation , vol.28 , pp. 505-535
- Gill, P.E.¹ Golub, G.H.² Murray, W.³ Saunders, M.A.⁴

15
- 0001596694
- Numerically stable methods for quadratic programming
- (1978) Mathematical programming , vol.14 , pp. 349-372
- Gill, P.E.¹ Murray, W.²

16
- 0343970575
- Extension of Newton's method and simplex methods for solving quadratic programs
- F.A., Lootsma, Academic Press, London
- (1972) Numerical methods for nonlinear optimization , pp. 239-254
- Goldfarb, D.¹

17
- 0016919818
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- (1975) Mathematical Programming , vol.10 , pp. 1-31
- Goldfarb, D.¹

18
- 0344616088
- Dual and primal-dual methods for solving strictly convex quadratic programs
- J.P., Hennart, Lecture Notes in Mathematics, 909, Springer-Verlag, Berlin
- (1982) Numerical Analysis, Proceedings Cocoyoc, Mexico 1981 , pp. 226-239
- Goldfarb, D.¹ Idnani, A.²

19
- 84867093640
- A primal-dual method for quadratic programming with bounded variables
- F.A., Lootsma, Academic Press, London
- (1972) Numerical methods for nonlinear optimization , pp. 255-263
- Goncalves, A.S.¹

20
- 0014604048
- A parametric method for semidefinite quadratic programs
- (1969) SIAM Journal on Control , vol.7 , pp. 559-577
- Grigoriadis, M.D.¹ Ritter, K.²

21
- 0000373474
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- (1976) Mathematical Programming , vol.11 , pp. 263-282
- Han, S-P.¹

22
- 84932521013
- MRC Technical Summary Report, 2180, M.R.C., University of Wisconsin, Madison, WI
- (1981) Solving quadratic programs by an exact penalty function
- Han, S-P.¹

23
- 84932551473
- City College of New York, Department of Computer Science, New York
- (1973) Extension of Newton's method for solving positive definite quadratic programs— A computational experience
- Idnani, A.U.¹

24
- 84932529592
- City College of New York. Department of Computer Science, New York
- (1980) Numerically stable dual projection methods for solving positive definite quadratic programs
- Idnani, A.U.¹

25
- 0003476369
- Prentice-Hall, Engelwood Cliffs, N.J.
- (1974) Solving least squares problems
- Lawson, C.L.¹ Hanson, R.J.²

26
- 0042753927
- A method of solution for quadratic programs
- (1962) Management Science , vol.8 , pp. 442-453
- Lemke, C.E.¹

27
- 34250263122
- A stable method for solving certain constrained least squares problems
- (1979) Mathematical Programming , vol.16 , pp. 141-158
- Mifflin, R.¹

28
- 84932592754
- W. Murray “An algorithm for finding a local minimum of an indefinite quadratic program”, NPL NAC Report No. 1 (1971).

29
- 0017908843
- Large-scale linearly constrained optimization
- (1978) Mathematical Programming , vol.14 , pp. 41-72
- Murtagh, B.A.¹ Saunders, M.A.²

30
- 0002207938
- A fast algorithm for nonlinearly constrained optimization calculations
- Lecture Notes in Mathematics, 630, Springer Verlag, Berlin
- (1978) Numerical analysis, Dundee, 1977 , pp. 144-157
- Powell, M.J.D.¹

31
- 13544253997
- An example of cycling in a feasible point algorithm
- (1981) Mathematical Programming , vol.20 , pp. 353-357
- Powell, M.J.D.¹

32
- 34250906530
- Ein Verfahren zur Lösung parameter-abhängiger, nichtlinearer Maximum-Probleme
- (1962) Unternehmensforschung , vol.6 , pp. 149-166
- Ritter, K.¹

33
- 0000788854
- The gradient projection method for nonlinear programming. Part 1. Linear constraints
- (1960) Journal of the Society for Industrial and Applied Mathematics , vol.8 , pp. 181-217
- Rosen, J.B.¹

34
- 84932564795
- J.B. Rosen and S. Suzuki, “Construction of nonlinear programming test problems”, Communications of the ACM (1965) 113.

35
- 0004146123
- Lecture Notes in Economics and Mathematical Systems, No. 183, Springer-Verlag, Berlin
- (1980) Nonlinear programming codes—Information, tests, performance
- Schittkowski, K.¹

36
- 0642323871
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- (1979) Numerische Mathematik , vol.31 , pp. 431-463
- Schittkowski, K.¹ Stoer, J.²

37
- 0000724440
- On the numerical solution of constrained least squares problems
- (1971) SIAM Journal on Numerical Analysis , vol.8 , pp. 382-411
- Stoer, J.¹

38
- 0011260025
- Quadratic programming as an extension of conventional quadratic maximization
- (1960) Management Science , vol.7 , pp. 1-20
- Theil, H.¹ Van De Panne, C.²

39
- 0042369351
- The simplex and the dual method for quadratic programming
- (1964) Journal of the Operational Research Society , vol.15 , pp. 355-389
- Van de Panne, C.¹ Whinston, A.²

40
- 0004102294
- Garduate School of Business Administration, Harvard University, Boston, MA
- (1963) A simplicial algorithm for concave programming
- Wilson, R.B.¹

41
- 0001136320
- The simplex method for quadratic programming
- (1959) Econometrica , vol.27 , pp. 382-398
- Wolfe, P.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.