메뉴 건너뛰기




Volumn 35, Issue 1, 2000, Pages 83-98

Optimal mechanism design using interior-point methods

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; FUNCTIONS; ITERATIVE METHODS; MACHINE DESIGN; NONLINEAR PROGRAMMING;

EID: 0033742829     PISSN: 0094114X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0094-114X(99)00003-8     Document Type: Article
Times cited : (33)

References (29)
  • 3
    • 0000788854 scopus 로고
    • The gradient projection method for nonlinear programming. Part I: Linear constraints
    • Rosen J.B. The gradient projection method for nonlinear programming. Part I: linear constraints. Journal of the Society for Industrial and Applied Mathematics. 8:1960;181-217.
    • (1960) Journal of the Society for Industrial and Applied Mathematics , vol.8 , pp. 181-217
    • Rosen, J.B.1
  • 4
    • 0019702847 scopus 로고
    • A state space technique for optimal design of mechanisms
    • New York: ASME
    • Sohoni V.N., Haug E.J. A state space technique for optimal design of mechanisms. Progress in Engineering Optimization. 1981;39-47 ASME, New York.
    • (1981) Progress in Engineering Optimization , pp. 39-47
    • Sohoni, V.N.1    Haug, E.J.2
  • 5
    • 0019697843 scopus 로고
    • Application of the generalized reduced gradient method to selected mechanism synthesis problems
    • New York: ASME
    • Fallahi B., Hall A.S., Ragsdell K.M. Application of the generalized reduced gradient method to selected mechanism synthesis problems. Progress in Engineering Optimization. 1981;49-56 ASME, New York.
    • (1981) Progress in Engineering Optimization , pp. 49-56
    • Fallahi, B.1    Hall, A.S.2    Ragsdell, K.M.3
  • 6
    • 0019668451 scopus 로고
    • Error linearization in the least-squares design of function generating mechanisms
    • New York: ASME
    • Wilde D.J. Error linearization in the least-squares design of function generating mechanisms. Progress in Engineering Optimization. 1981;33-37 ASME, New York.
    • (1981) Progress in Engineering Optimization , pp. 33-37
    • Wilde, D.J.1
  • 7
    • 0016025386 scopus 로고
    • Synthesis of function generating mechanisms using Marquardt's method
    • Chen F.Y., Chan V-L. Synthesis of function generating mechanisms using Marquardt's method. ASME Journal of Engineering for Industry. 96:1974;131-137.
    • (1974) ASME Journal of Engineering for Industry , vol.96 , pp. 131-137
    • Chen, F.Y.1    Chan, V.-L.2
  • 8
    • 0016470414 scopus 로고
    • An improved least squares method for designing function generating mechanisms
    • Sutherland G.H., Roth R. An improved least squares method for designing function generating mechanisms. ASME Journal of Engineering for Industry. 97:1975;303-307.
    • (1975) ASME Journal of Engineering for Industry , vol.97 , pp. 303-307
    • Sutherland, G.H.1    Roth, R.2
  • 9
    • 0023573702 scopus 로고
    • Recovering the optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
    • Ye Y. Recovering the optimal dual solutions in Karmarkar's polynomial algorithm for linear programming. Mathematical Programming. 39:1987;305-317.
    • (1987) Mathematical Programming , vol.39 , pp. 305-317
    • Ye, Y.1
  • 11
    • 0027803251 scopus 로고
    • On quadratic and O ( nL ) convergence of predictor-corrector algorithm for LCP
    • Ye Y., Anstreicher K. On quadratic and O ( nL ) convergence of predictor-corrector algorithm for LCP. Mathematical Programming. 62:1993;537-552.
    • (1993) Mathematical Programming , vol.62 , pp. 537-552
    • Ye, Y.1    Anstreicher, K.2
  • 12
    • 34250081000 scopus 로고
    • 3L) primal-dual potential reduction algorithm for solving convex quadratic programs
    • 3L) primal-dual potential reduction algorithm for solving convex quadratic programs. Mathematical Programming. 61:1993;161-170.
    • (1993) Mathematical Programming , vol.61 , pp. 161-170
    • Goldfarb, D.1    Liu, S.2
  • 13
    • 0024665753 scopus 로고
    • Interior path following primal-dual algorithms. Part II: Convex quadratic programming
    • Monteiro R.C., Adler I. Interior path following primal-dual algorithms. Part II: convex quadratic programming. Mathematical Programming. 44:1989;43-66.
    • (1989) Mathematical Programming , vol.44 , pp. 43-66
    • Monteiro, R.C.1    Adler, I.2
  • 14
    • 0000444718 scopus 로고
    • A path following algorithm for a class of convex programming problems
    • Zhu J. A path following algorithm for a class of convex programming problems. ZOR-Methods and Models of Operations Research. 36:1992;359-377.
    • (1992) ZOR-Methods and Models of Operations Research , vol.36 , pp. 359-377
    • Zhu, J.1
  • 15
    • 0004792910 scopus 로고
    • On some efficient interior point methods for nonlinear convex programming
    • Kortanek K.O., Potra F., Ye Y. On some efficient interior point methods for nonlinear convex programming. Linear Algebra and its Applications. 152:1991;169-198.
    • (1991) Linear Algebra and Its Applications , vol.152 , pp. 169-198
    • Kortanek, K.O.1    Potra, F.2    Ye, Y.3
  • 16
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • Karmarkar N. A new polynomial time algorithm for linear programming. Combinatorica. 4:1984;373-395.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 17
    • 0027667652 scopus 로고
    • A primal-dual infeasible-interior-point algorithm for linear programming
    • Kojima M., Megiddo N., Mizuno S. A primal-dual infeasible-interior-point algorithm for linear programming. Mathematical Programming. 61:1993;263-280.
    • (1993) Mathematical Programming , vol.61 , pp. 263-280
    • Kojima, M.1    Megiddo, N.2    Mizuno, S.3
  • 18
    • 0000022796 scopus 로고
    • On implementing Mehrotra's predictor-corrector interior point method for linear programming
    • Lustig I.J., Marsten R.E., Shanno D.F. On implementing Mehrotra's predictor-corrector interior point method for linear programming. SIAM Journal on Optimization. 2:1992;435-449.
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 435-449
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 19
    • 0000114112 scopus 로고
    • Computational experience with a primal-dual interior-point method for linear programming
    • Lustig I.J., Marsten R.E., Shanno D.F. Computational experience with a primal-dual interior-point method for linear programming. Linear Algebra and its Applications. 152:1991;191-222.
    • (1991) Linear Algebra and Its Applications , vol.152 , pp. 191-222
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 20
    • 0002431411 scopus 로고
    • An implementation of a primal-dual interior point method for linear programming
    • McShane K.A., Monma C.L., Shanno D. An implementation of a primal-dual interior point method for linear programming. ORSA Journal on Computing. 1:1989;70-83.
    • (1989) ORSA Journal on Computing , vol.1 , pp. 70-83
    • McShane, K.A.1    Monma, C.L.2    Shanno, D.3
  • 21
    • 0000561116 scopus 로고
    • On the implementation of a primal-dual interior point
    • Mehrotra S. On the implementation of a primal-dual interior point. SIAM Journal on Optimization. 2:1992;575-601.
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 575-601
    • Mehrotra, S.1
  • 23
    • 0028405417 scopus 로고
    • A global convergent primal-dual interior point algorithm for convex programming
    • Monteiro R.D.C. A global convergent primal-dual interior point algorithm for convex programming. Mathematical Programming. 64:1994;123-147.
    • (1994) Mathematical Programming , vol.64 , pp. 123-147
    • Monteiro, R.D.C.1
  • 24
    • 34249773505 scopus 로고
    • Superlinear convergence of infeasible-interior-point methods for linear programming
    • Zhang Y., Zhang D. Superlinear convergence of infeasible-interior-point methods for linear programming. Mathematical Programming. 66:1994;361-377.
    • (1994) Mathematical Programming , vol.66 , pp. 361-377
    • Zhang, Y.1    Zhang, D.2
  • 26
    • 0028524565 scopus 로고
    • Polynomiality of infeasible-interior-point algorithms for linear programming
    • Mizuno S. Polynomiality of infeasible-interior-point algorithms for linear programming. Mathematical Programming. 67:1994;109-119.
    • (1994) Mathematical Programming , vol.67 , pp. 109-119
    • Mizuno, S.1
  • 28
    • 34250232455 scopus 로고
    • The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangian type line search function, Part I: Convergence analysis
    • Schittkowski K. The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangian type line search function, Part I: convergence analysis. Numerical Mathematics. 38:1981;83-114.
    • (1981) Numerical Mathematics , vol.38 , pp. 83-114
    • Schittkowski, K.1
  • 29
    • 0004323381 scopus 로고
    • Technical report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, CA
    • B.A. Murtagh, M.A. Saunders, MINOS 1.5 user's guide. Technical report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, CA, 1987.
    • (1987) MINOS 1.5 User's Guide
    • Murtagh, B.A.1    Saunders, M.A.2


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