메뉴 건너뛰기




Volumn 20, Issue SUPPL.1, 1996, Pages

Validation of measurement data using an interior point SQP

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ENGINEERING; COMPUTER PROGRAMMING; DATA PROCESSING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PERFORMANCE; PROBLEM SOLVING; STEAM POWER PLANTS;

EID: 0029720140     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/0098-1354(96)00103-2     Document Type: Article
Times cited : (13)

References (22)
  • 1
    • 0000110392 scopus 로고
    • An implementation of Karmarkar's algorithm for linear programming
    • Adler, I., Karmarkar, N.K., Resende, M.G.C., and Veiga, G., 1989, An implementation of Karmarkar's algorithm for linear programming. Math. Prog. 44, 297-335.
    • (1989) Math. Prog. , vol.44 , pp. 297-335
    • Adler, I.1    Karmarkar, N.K.2    Resende, M.G.C.3    Veiga, G.4
  • 2
    • 0002674910 scopus 로고
    • The watchdog technique for forcing convergence in algorithms for constrained optimization
    • Chamberlain, R.M., Powell, M.J.D., Lemaréchal, C., and Pederson, H.C., 1982, The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Prog. Study 16, 1-17.
    • (1982) Math. Prog. Study , vol.16 , pp. 1-17
    • Chamberlain, R.M.1    Powell, M.J.D.2    Lemaréchal, C.3    Pederson, H.C.4
  • 3
    • 0021577388 scopus 로고
    • Enhancements of the Hann-Powell Method for Successive Quadratic Programming
    • Chen, H.C., and Stadtherr, M.A., 1984, Enhancements of the Hann-Powell Method for Successive Quadratic Programming. Comp. Chem. Engng. 8 3/4, 229-234.
    • (1984) Comp. Chem. Engng. , vol.8 , Issue.3-4 , pp. 229-234
    • Chen, H.C.1    Stadtherr, M.A.2
  • 4
    • 0041603476 scopus 로고
    • Further development of a primal-dual interior point method
    • Choi, I.C., Monma, C.L., and Shanno, D.F., 1990, Further development of a primal-dual interior point method. ORSA J. Comput. 2, 304-311.
    • (1990) ORSA J. Comput. , vol.2 , pp. 304-311
    • Choi, I.C.1    Monma, C.L.2    Shanno, D.F.3
  • 5
    • 0043247176 scopus 로고    scopus 로고
    • Sensitivity calculations and variance analysis in plant measurement reconciliation
    • Paper presented
    • Heyen, G., Maréchal, E., and Kalitventzeff, B., 1996, Sensitivity calculations and variance analysis in plant measurement reconciliation. Paper presented at ESCAPE-6.
    • (1996) ESCAPE-6
    • Heyen, G.1    Maréchal, E.2    Kalitventzeff, B.3
  • 7
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • Karmarkar, N.K., 1984, A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-395.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.K.1
  • 8
    • 0028336454 scopus 로고
    • Can existing software handle industrial optimization problems? Optimization of the KEMIRA's (B) ammonia synthesis loop
    • Kontopoulos, A.J., Kalitventzeff, B., Rennotte, J., and Bovens, J.L., 1994, Can existing software handle industrial optimization problems? Optimization of the KEMIRA's (B) ammonia synthesis loop. Comp. Chem. Engng. 18 Suppl., 165-169.
    • (1994) Comp. Chem. Engng. , vol.18 , Issue.SUPPL. , pp. 165-169
    • Kontopoulos, A.J.1    Kalitventzeff, B.2    Rennotte, J.3    Bovens, J.L.4
  • 9
    • 0020221028 scopus 로고
    • Large scale nonlinear programming
    • Lasdon, L.S., and Waren, A.D., 1983, Large scale nonlinear programming. Comp. Chem. Engng. 75, 595-604.
    • (1983) Comp. Chem. Engng. , vol.7 , Issue.5 , pp. 595-604
    • Lasdon, L.S.1    Waren, A.D.2
  • 10
    • 0025382880 scopus 로고
    • Chemical process optimization using Newton-like methods
    • Lucia, A., and Xu, J., 1990, Chemical process optimization using Newton-like methods. Comp. Chem. Engng. 142, 119-138.
    • (1990) Comp. Chem. Engng. , vol.14 , Issue.2 , pp. 119-138
    • Lucia, A.1    Xu, J.2
  • 11
    • 9744257292 scopus 로고
    • Feasibility issues in a primal-dual interior point method for linear programming
    • Lustig, I.J., 1991, Feasibility issues in a primal-dual interior point method for linear programming. Math. Prog. 49, 145-162.
    • (1991) Math. Prog. , vol.49 , pp. 145-162
    • Lustig, I.J.1
  • 14
    • 0002187697 scopus 로고
    • Quadratic convergence in a primal-dual method
    • Mehrotra, S., 1993, Quadratic convergence in a primal-dual method. Math. Oper. Research 15, 741-751.
    • (1993) Math. Oper. Research , vol.15 , pp. 741-751
    • Mehrotra, S.1
  • 15
    • 0000836925 scopus 로고
    • On adaptive-step primal-dual interior-point algorithms for linear programming
    • Mizuno, S., Todd, M.J., and Ye, Y., 1993, On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Research 18, 964-981.
    • (1993) Math. Oper. Research , vol.18 , pp. 964-981
    • Mizuno, S.1    Todd, M.J.2    Ye, Y.3
  • 16
    • 0024665752 scopus 로고
    • Interior path-following primal-dual algorithms. Part I: Linear programming
    • Monteiro, R.D.C., and Adler, I., 1989, Interior path-following primal-dual algorithms. Part I: linear programming. Math. Prog. 44, 27-41
    • (1989) Math. Prog. , vol.44 , pp. 27-41
    • Monteiro, R.D.C.1    Adler, I.2
  • 17
    • 0024665753 scopus 로고
    • Interior path-following primal-dual algorithms. Part II: Convex quadratic programming
    • Monteiro, R.D.C., and Adler, L, 1989, Interior path-following primal-dual algorithms. Part II: convex quadratic programming. Math. Prog. 44, 43-66.
    • (1989) Math. Prog. , vol.44 , pp. 43-66
    • Monteiro, R.D.C.1    Adler, L.2
  • 18
    • 0043247174 scopus 로고
    • Numerical experiments with an interior point method for large scale convex quadratic programming
    • Talk held IL, USA, May, 1992
    • Morales-Perez, J.L., and Sargent, R.W.H., 1992, Numerical experiments with an interior point method for large scale convex quadratic programming. Talk held at the Fourth SIAM Conference on Optimization in Chicago, IL, USA, May, 1992.
    • (1992) Fourth SIAM Conference on Optimization in Chicago
    • Morales-Perez, J.L.1    Sargent, R.W.H.2
  • 19
    • 0002207938 scopus 로고
    • A fast algorithm for nonlinearly constrained optimization problems
    • (G.A. Watson, Ed.), Springer-Verlag, Berlin
    • Powell, M.J.D., 1978, A fast algorithm for nonlinearly constrained optimization problems. Numerical Analysis (G.A. Watson, Ed.), Springer-Verlag, Berlin.
    • (1978) Numerical Analysis
    • Powell, M.J.D.1
  • 20
    • 0027595965 scopus 로고
    • Acceleration of Reduced Hessian methods for large-scale nonlinear programming
    • Schmid, C., and Biegler, L.T., 1993, Acceleration of Reduced Hessian methods for large-scale nonlinear programming. Comp. Chem. Engng. 17 5/6, 451-463.
    • (1993) Comp. Chem. Engng. , vol.17 , Issue.5-6 , pp. 451-463
    • Schmid, C.1    Biegler, L.T.2
  • 21
    • 0028500958 scopus 로고
    • Quadratic programming methods for Reduced Hessian SQP
    • Schmid, C., and Biegler, L.T., 1994, Quadratic programming methods for Reduced Hessian SQP. Comp. Chem. Engng. 189, 817-832.
    • (1994) Comp. Chem. Engng. , vol.18 , Issue.9 , pp. 817-832
    • Schmid, C.1    Biegler, L.T.2
  • 22
    • 0000663427 scopus 로고
    • Large-scale decomposition for successive quadratic programming
    • Vasantharajan, S., and Biegler, L.T., 1988, Large-scale decomposition for successive quadratic programming. Comp. Chem. Engng. 12 11, 1087-1101.
    • (1988) Comp. Chem. Engng. , vol.12 , Issue.11 , pp. 1087-1101
    • Vasantharajan, S.1    Biegler, L.T.2


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