-
1
-
-
0003819902
-
Interior point methods for nonconvex nonlinear programming: Filter methods and merit functions
-
Dept. of ORFE, Princeton University, to appear in COAP
-
H. Benson, D. Shanno, and R. Vanderbei, "Interior point methods for nonconvex nonlinear programming: filter methods and merit functions," Technical Report ORFE-00-6, Dept. of ORFE, Princeton University, to appear in COAP.
-
Technical Report
, vol.ORFE-00-6
-
-
Benson, H.1
Shanno, D.2
Vanderbei, R.3
-
2
-
-
4544344687
-
-
Mathematics and Computer Science Division, Argonne National Laboratory
-
A.S. Bondarenko, D.M. Bortz, and J.J. More, "COPS: Constrained optimization problems," Mathematics and Computer Science Division, Argonne National Laboratory, http://www-unix.mcs.anl.gov/more/cops
-
COPS: Constrained Optimization Problems
-
-
Bondarenko, A.S.1
Bortz, D.M.2
More, J.J.3
-
3
-
-
0000024679
-
CUTE: Constrained and unconstrained testing environment
-
I. Bongartz, A. Conn, N. Gould, and P. Toint, "CUTE: Constrained and unconstrained testing environment," ACM Transactions on Mathematical Software, vol. 21, no. 1, pp. 123-160, 1993.
-
(1993)
ACM Transactions on Mathematical Software
, vol.21
, Issue.1
, pp. 123-160
-
-
Bongartz, I.1
Conn, A.2
Gould, N.3
Toint, P.4
-
4
-
-
0012126939
-
Nonlinear programming. Sequential unconstrained minimization techniques
-
SIAM Philadelphia, PA
-
A. Fiacco and G. McCormick, "Nonlinear programming. sequential unconstrained minimization techniques," SIAM Classic in Applied Mathematics, SIAM Philadelphia, PA, 1990.
-
(1990)
SIAM Classic in Applied Mathematics
-
-
Fiacco, A.1
McCormick, G.2
-
5
-
-
0001556338
-
Nonlinear programming without a penalty function
-
R. Fletcher and S. Leyfer, "Nonlinear programming without a penalty function," Mathematical Programming, vol. 91, no. 2, pp. 239-269, 2002.
-
(2002)
Mathematical Programming
, vol.91
, Issue.2
, pp. 239-269
-
-
Fletcher, R.1
Leyfer, S.2
-
6
-
-
0022808235
-
On projected Newton barrier method for linear programming and equivalence to Karmarkar's projective method
-
P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin, and M.H. Wright, "On projected Newton barrier method for linear programming and equivalence to Karmarkar's projective method," Mathematical Programming, vol. 36, pp. 183-209, 1986.
-
(1986)
Mathematical Programming
, vol.36
, pp. 183-209
-
-
Gill, P.E.1
Murray, W.2
Saunders, M.A.3
Tomlin, J.A.4
Wright, M.H.5
-
7
-
-
31744440498
-
Primal-dual nonlinear rescaling method with dynamic scaling parameter update
-
to appear
-
I. Griva and R. Polyak, "Primal-dual nonlinear rescaling method with dynamic scaling parameter update," Mathematical Programming (to appear).
-
Mathematical Programming
-
-
Griva, I.1
Polyak, R.2
-
8
-
-
0015725558
-
Multiplier methods for convex programming
-
San Diego, California
-
B.W. Kort and D.P. Bertsekas, "Multiplier methods for convex programming," in Proceedings IEEE Conference on Decision and Control, San Diego, California, pp. 428-432, 1973.
-
(1973)
Proceedings IEEE Conference on Decision and Control
, pp. 428-432
-
-
Kort, B.W.1
Bertsekas, D.P.2
-
9
-
-
0001662422
-
Interior point methods for linear programming; computational state of the art
-
I. Lustig, R. Marsten, and D. Shanno, "Interior point methods for linear programming; computational state of the art," ORSA Journal on Computing, vol. 6, pp. 1-14, 1994.
-
(1994)
ORSA Journal on Computing
, vol.6
, pp. 1-14
-
-
Lustig, I.1
Marsten, R.2
Shanno, D.3
-
10
-
-
0001961709
-
Pathways to the optimal set in linear programming
-
N. Megiddo (Ed.), Ch. 8, Springer-Verlag: New York
-
N. Megiddo, "Pathways to the optimal set in linear programming," in Interior Point and Related Methods, N. Megiddo (Ed.), Ch. 8, Springer-Verlag: New York, 1989, pp. 131-158.
-
(1989)
Interior Point and Related Methods
, pp. 131-158
-
-
Megiddo, N.1
-
12
-
-
34249830808
-
Modified barrier functions
-
R. Polyak, "Modified barrier functions," Mathematical Programming, vol. 54, pp. 177-222, 1992.
-
(1992)
Mathematical Programming
, vol.54
, pp. 177-222
-
-
Polyak, R.1
-
13
-
-
0041629347
-
Nonlinear rescaling and Proximal-like methods in convex optimization
-
R. Polyak and M. Teboulle, "Nonlinear rescaling and Proximal-like methods in convex optimization," Mathematical Programming, vol. 76, pp. 265-284, 1997.
-
(1997)
Mathematical Programming
, vol.76
, pp. 265-284
-
-
Polyak, R.1
Teboulle, M.2
-
14
-
-
84983127822
-
The Newton log-Sigmoid method in Constrained Optimization
-
A Collection of Technical Papers
-
R. Polyak, I. Griva, and J. Sobieski, "The Newton log-Sigmoid method in Constrained Optimization," A Collection of Technical Papers, 7th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization vol. 3, 1998, pp. 2193-2201.
-
(1998)
7th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization
, vol.3
, pp. 2193-2201
-
-
Polyak, R.1
Griva, I.2
Sobieski, J.3
-
15
-
-
4043111445
-
Nonlinear rescaling vs. Smoothing technique in convex optimization
-
R. Polyak, "Nonlinear rescaling vs. smoothing technique in convex optimization," Mathematical Programming, Ser. A, vol. 92, pp. 197-235, 2002.
-
(2002)
Mathematical Programming, Ser. A
, vol.92
, pp. 197-235
-
-
Polyak, R.1
-
16
-
-
4544336037
-
Primal-dual nonlinear rescaling method for Convex Optimization
-
SEOR Technical report SEOR-02-05, to appear in
-
R. Polyak and I. Griva, "Primal-dual nonlinear rescaling method for Convex Optimization," SEOR Technical report SEOR-02-05, http://www.princeton.edu/igriva/papers.html to appear in JOTA.
-
JOTA
-
-
Polyak, R.1
Griva, I.2
-
17
-
-
0011306055
-
Unified complexity analysis for Newton LP methods
-
School of Operations Research and Industrial Engineering, College of Engineering, Cornell University, Ithaca, NY
-
J. Renegar and M. Shub, "Unified complexity analysis for Newton LP methods," Technical Report No. 807, School of Operations Research and Industrial Engineering, College of Engineering, Cornell University, Ithaca, NY, 1988.
-
(1988)
Technical Report No. 807
, vol.807
-
-
Renegar, J.1
Shub, M.2
-
18
-
-
0002090173
-
Symmetric quasidefinite matrices
-
R. Vanderbei, "Symmetric quasidefinite matrices," SIAM Journal on Optimization, vol. 5, no. 1, pp. 100-113, 1995.
-
(1995)
SIAM Journal on Optimization
, vol.5
, Issue.1
, pp. 100-113
-
-
Vanderbei, R.1
-
19
-
-
0000287204
-
An interior-point algorithm for nonconvex nonlinear programming
-
R.I. Vanderbei and D.F. Shanno, "An interior-point algorithm for nonconvex nonlinear programming," COAP, vol. 13, pp. 231-252, 1999.
-
(1999)
COAP
, vol.13
, pp. 231-252
-
-
Vanderbei, R.I.1
Shanno, D.F.2
-
20
-
-
0033293912
-
LOQO: An interior point code for quadratic programming
-
R.J. Vanderbei, "LOQO: An interior point code for quadratic programming," Optimization Methods and Software, vol. 12, pp. 451-484, 1999.
-
(1999)
Optimization Methods and Software
, vol.12
, pp. 451-484
-
-
Vanderbei, R.J.1
|