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

메뉴 건너뛰기

Journal of Mathematical Analysis and Applications

Volumn 246, Issue 1, 2000, Pages 100-121

Minimal representation of convex regions defined by analytic functions

(1) Obuchowska, Wiesława T a

a STATE UNIVERSITY OF NEW YORK AT FREDONIA (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034196725 PISSN: 0022247X EISSN: None Source Type: Journal
DOI: 10.1006/jmaa.2000.6759 Document Type: Article

Times cited : (1)

References (17)

1
- 33748096434
- On the best case performance of hit and run methods for detecting necessary constraints
- Caron R. J., Hlynka M., McDonald J. F. On the best case performance of hit and run methods for detecting necessary constraints. Math. Programming. 54:1992;233-249.
- (1992) Math. Programming , vol.54 , pp. 233-249
- Caron R., J.¹ Hlynka, M.² McDonald J., F.³

2
- 0029185215
- An algorithm to determine boundedness of quadratically constrained convex quadratic programmes
- Caron R. J., Obuchowska W. T. An algorithm to determine boundedness of quadratically constrained convex quadratic programmes. European J. Oper. Res. 80:1995;431-438.
- (1995) European J. Oper. Res. , vol.80 , pp. 431-438
- Caron R., J.¹ Obuchowska W., T.²

3
- 0002830663
- A large-step analytic center method for a class of smooth convex programming problems
- Den Hertog D., Ross C., Terlaky T. A large-step analytic center method for a class of smooth convex programming problems. SIAM J. Optim. 2:1992;55-70.
- (1992) SIAM J. Optim. , vol.2 , pp. 55-70
- Den Hertog, D.¹ Ross, C.² Terlaky, T.³

4
- 85037790151
- Representation of convex sets
- Austin, Texas
- U. Eckhardt, Representation of convex sets, in, Proceedings of the International Symposium on External Methods and Systems Analysis, Austin, Texas, 1979.
- (1979) Proceedings of the International Symposium on External Methods and Systems Analysis
- Eckhardt, U.¹

5
- 0003451149
- New York: Wiley
- Fiacco A. V., McCormick G. P. Nonlinear Programming: A Sequential Unconstrained Minimization Technique. 1968;Wiley, New York.
- (1968) Nonlinear Programming: A Sequential Unconstrained Minimization Technique
- Fiacco A., V.¹ McCormick G., P.²

6
- 0001666256
- A logarithmic barrier function algorithm for quadratically constrained convex quadratic programming
- Goldfarb D., Liu S., Wang S. A logarithmic barrier function algorithm for quadratically constrained convex quadratic programming. SIAM J. Optim. 1:1991;252-267.
- (1991) SIAM J. Optim. , vol.1 , pp. 252-267
- Goldfarb, D.¹ Liu, S.² Wang, S.³

7
- 0003960784
- New York: Prentice Hall
- Gunning R. C., Rossi H. Analytic Functions of Several Complex Variables. 1965;Prentice Hall, New York.
- (1965) Analytic Functions of Several Complex Variables
- Gunning R., C.¹ Rossi, H.²

8
- 0003529551
- Berlin/New York: Springer-Verlag
- Hiriart-Urutty J.-B., Lemarechal C. Convex Analysis and Minimization Algorithms I. 1993;Springer-Verlag, Berlin/New York.
- (1993) Convex Analysis and Minimization Algorithms I
- Hiriart-Urutty, J.-B.¹ Lemarechal, C.²

9
- 0022130538
- Numerical decomposition of a convex function
- Lamoureaux M., Wolkowicz H. Numerical decomposition of a convex function. J. Optim. Theory Appl. 47:1985;51-64.
- (1985) J. Optim. Theory Appl. , vol.47 , pp. 51-64
- Lamoureaux, M.¹ Wolkowicz, H.²

10
- 0000957701
- 3.5L) arithmetic operations
- 3.5L) arithmetic operations. Math. Oper. Res. 15:1990;352-363.
- (1990) Math. Oper. Res. , vol.15 , pp. 352-363
- Mehrotra, S.¹ Sun, Y.²

11
- 0003630894
- Philadelphia: SIAM
- Nesterov Y. E., Nemirovsky A. S. Interior-Point Polynomial Algorithms in Convex Programming. 1994;SIAM, Philadelphia.
- (1994) Interior-Point Polynomial Algorithms in Convex Programming
- Nesterov Y., E.¹ Nemirovsky A., S.²

12
- 0002608202
- Minimal representation of quadratically constrained feasible regions
- Obuchowska W. T., Caron R. J. Minimal representation of quadratically constrained feasible regions. Math. Programming. 68:1995;169-186.
- (1995) Math. Programming , vol.68 , pp. 169-186
- Obuchowska W., T.¹ Caron R., J.²

13
- 0002576050
- Ph.D. thesis, University of Windsor
- W. T. Obuchowska, Quadratic Programmes with Quadratic Constraints, Ph.D. thesis, University of Windsor, 1995.
- (1995) Quadratic Programmes with Quadratic Constraints
- Obuchowska W., T.¹

14
- 0004267646
- Princeton: Princeton Univ. Press
- Rockafellar R. T. Convex Analysis. 1979;Princeton Univ. Press, Princeton.
- (1979) Convex Analysis
- Rockafellar R., T.¹

15
- 0002524136
- Some convex programs whose duals are linearly constrained
- J. B. Rosen, O. L. Mangasarian, & K. Ritter. New York: Academic Press
- Rockafellar R. T. Some convex programs whose duals are linearly constrained. Rosen J. B., Mangasarian O. L., Ritter K., Nonlinear Programming. 1970;293-322 Academic Press, New York.
- (1970) Nonlinear Programming , pp. 293-322
- Rockafellar R., T.¹

16
- 0020178774
- Minimal representation of convex polyhedral sets
- Telgen J. Minimal representation of convex polyhedral sets. J. Optim. Theory Appl. 38:1982;1-24.
- (1982) J. Optim. Theory Appl. , vol.38 , pp. 1-24
- Telgen, J.¹

17
- 0020793129
- Method of reduction in convex programming
- Wolkowicz H. Method of reduction in convex programming. J. Optim. Theory Appl. 40:1983;349-378.
- (1983) J. Optim. Theory Appl. , vol.40 , pp. 349-378
- Wolkowicz, H.¹

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