Result 1 to 20 of 98 total
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. (English)
IMA J. Numer. Anal. 32, No. 4, 1662-1695 (2012).
1
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. (English)
SIAM J. Optim. 22, No. 1, 66-86 (2012).
2
A second-derivative SQP method with a ‘trust-region-free’ predictor step. (English)
IMA J. Numer. Anal. 32, No. 2, 580-601 (2012).
3
Erratum to: “Nonlinear programming without a penalty function or a filter”. (English)
Math. Program. 131, No. 1-2(A), 403-404 (2012).
4
Complexity bounds for second-order optimality in unconstrained optimization. (English)
J. Complexity 28, No. 1, 93-108 (2012).
5
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. (English)
SIAM J. Optim. 21, No. 4, 1721-1739 (2011).
6
Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity. (English)
Math. Program. 130, No. 2 (A), 295-319 (2011).
7
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results. (English)
Math. Program. 127, No. 2 (A), 245-295 (2011).
8
On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization problems. (English)
SIAM J. Optim. 20, No. 6, 2833-2852 (2010).
9
Preconditioning saddle-point systems with applications in optimization. (English)
SIAM J. Sci. Comput. 32, No. 1, 249-270 (2010).
10
Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares. (English)
SIAM J. Numer. Anal. 48, No. 1, 1-29 (2010).
11
A second derivative SQP method: local convergence and practical issues. (English)
SIAM J. Optim. 20, No. 4, 2049-2079 (2010).
12
A second derivative SQP method: global convergence. (English)
SIAM J. Optim. 20, No. 4, 2023-2048 (2010).
13
Spectral analysis of saddle point matrices with indefinite leading blocks. (English)
SIAM J. Matrix Anal. Appl. 31(2009), No. 3, 1152-1171 (2010).
14
On solving trust-region and other regularised subproblems in optimization. (English)
Math. Program. Comput. 2, No. 1, 21-57 (2010).
15
Nonlinear programming without a penalty function or a filter. (English)
Math. Program. 122, No. 1 (A), 155-196 (2010); erratum ibid. 131, No. 1-2(A), 403-404 (2012).
16
A second derivative SQP method: local convergence and practical issues (English)
SIAM Journal on Optimization 20, No. 4, 2049-2079 (2010).
17
A second derivative SQP method: global convergence (English)
SIAM Journal on Optimization 20, No. 4, 2023-2048 (2010).
18
On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization problems (English)
SIAM Journal on Optimization 20, No. 6, 2833-2852 (2010).
19
Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares (English)
SIAM J. Numerical Analysis 48, No. 1, 1-29 (2010).
20
Result 1 to 20 of 98 total
Start
Contact
Print
General Help
