SCOPUS 정보 검색 플랫폼

Mathematical Programming

Volumn 119, Issue 1, 2009, Pages 95-107

A geometric analysis of Renegar's condition number, and its interplay with conic curvature

(2) Belloni, Alexandre a Freund, Robert M b

a DUKE UNIVERSITY (United States)

b MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; CONES; CONTROL THEORY; LINEAR SYSTEMS; NUMBER THEORY;

COMPLEXITY OF ALGORITHMS; CONDITION NUMBERS; CONIC LINEAR SYSTEMS; CONVEX CONES; DATA PERTURBATIONS; ERROR BOUNDS; FEASIBLE SOLUTIONS; GEOMETRIC ANALYSIS; GEOMETRIC QUANTITIES; LOWER AND UPPER BOUNDS; LOWER BOUNDS; SINGULAR VALUES;

COMPUTATIONAL COMPLEXITY;

EID: 60449089893 PISSN: 00255610 EISSN: 14364646 Source Type: Journal
DOI: 10.1007/s10107-007-0203-8 Document Type: Article

Times cited : (25)

References (11)

1
- 60449095935
- An efficient re-scaled perceptron algorithm for conic systems
- no. OR-379-06
- Belloni, A., Freund, R.M., Vempala, S.: An efficient re-scaled perceptron algorithm for conic systems. MIT Operations Research Center Working Paper (2006), no. OR-379-06
- (2006) MIT Operations Research Center Working Paper
- Belloni, A.¹ Freund, R.M.² Vempala, S.³

2
- 0003713964
- Athena Scientific Nashua
- Bertsekas D. (1999). Nonlinear Programming. Athena Scientific, Nashua
- (1999) Nonlinear Programming
- Bertsekas, D.¹

3
- 0033261317
- Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm
- 1
- R.M. Freund J.R. Vera 1999 Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm SIAM J. Optimi. 10 1 155 176
- (1999) SIAM J. Optimi. , vol.10 , pp. 155-176
- Freund, R.M.¹ Vera, J.R.²

4
- 0000553640
- Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system
- 2
- R.M. Freund J.R. Vera 1999 Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system Math. Program. 86 2 225 260
- (1999) Math. Program. , vol.86 , pp. 225-260
- Freund, R.M.¹ Vera, J.R.²

5
- 21044445470
- Complexity of convex optimization using geometry-based measures and a reference point
- R.M. Freund 2004 Complexity of convex optimization using geometry-based measures and a reference point Math. Program. 99 197 221
- (2004) Math. Program. , vol.99 , pp. 197-221
- Freund, R.M.¹

6
- 0013496760
- Constrained minimization methods
- E. Levitin B.J. Poljak 1963 Constrained minimization methods U.S.S.R. Comput. Math. Math. Phys. 6 787 823
- (1963) U.S.S.R. Comput. Math. Math. Phys. , vol.6 , pp. 787-823
- Levitin, E.¹ Poljak, B.J.²

7
- 0042391293
- Existence theorems and convergence of minimizing sequences in extremum problems with restrictions
- B.J. Poljak 1966 Existence theorems and convergence of minimizing sequences in extremum problems with restrictions Soviet Math. 7 72 75
- (1966) Soviet Math. , vol.7 , pp. 72-75
- Poljak, B.J.¹

8
- 0028426653
- Some perturbation theory for linear programming
- 1
- J. Renegar 1994 Some perturbation theory for linear programming Math. Program. 65 1 73 91
- (1994) Math. Program. , vol.65 , pp. 73-91
- Renegar, J.¹

9
- 58149364311
- Linear programming, complexity theory, and elementary functional analysis
- 3
- J. Renegar 1995 Linear programming, complexity theory, and elementary functional analysis Math. Program. 70 3 279 351
- (1995) Math. Program. , vol.70 , pp. 279-351
- Renegar, J.¹

10
- 0001178607
- Strong convexity of sets and functions
- J.-P. Vial 1982 Strong convexity of sets and functions J. Math. Econ. 9 187 205
- (1982) J. Math. Econ. , vol.9 , pp. 187-205
- Vial, J.-P.¹

11
- 0000371910
- Strong and weak convexity of sets and functions
- 2
- J.-P. Vial 1983 Strong and weak convexity of sets and functions Math. Oper. Res. 8 2 231 259
- (1983) Math. Oper. Res. , vol.8 , pp. 231-259
- Vial, J.-P.¹

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