evaluation complexity Latest Research Papers

Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations

Computational and Applied Mathematics ◽

10.1007/s40314-021-01621-4 ◽

2021 ◽

Vol 40 (8) ◽

Author(s):

Geovani N. Grapiglia ◽

Flávia Chorobura

Keyword(s):

Nonlinear Systems ◽

Line Search ◽

Nonmonotone Line Search ◽

Systems Of Equations ◽

Nonlinear Systems Of Equations ◽

Worst Case ◽

Case Evaluation ◽

Derivative Free ◽

Line Search Methods ◽

Evaluation Complexity

Download Full-text

High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms

Mathematical Programming ◽

10.1007/s10107-020-01470-9 ◽

2020 ◽

Author(s):

X. Chen ◽

Ph. L. Toint

Keyword(s):

Constrained Optimization ◽

High Order ◽

Group Sparsity ◽

Evaluation Complexity

Download Full-text

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints

SIAM Journal on Optimization ◽

10.1137/17m1144854 ◽

2020 ◽

Vol 30 (1) ◽

pp. 513-541

Author(s):

Coralia Cartis ◽

Nicholas I. M. Gould ◽

Philippe L. Toint

Keyword(s):

Nonconvex Optimization ◽

Arbitrary Order ◽

Worst Case ◽

Complexity Bounds ◽

Case Evaluation ◽

Evaluation Complexity

Download Full-text

Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization

Journal of Complexity ◽

10.1016/j.jco.2018.11.001 ◽

2019 ◽

Vol 53 ◽

pp. 68-94 ◽

Cited By ~ 2

Author(s):

C. Cartis ◽

N.I.M. Gould ◽

Ph.L. Toint

Keyword(s):

Nonconvex Optimization ◽

Evaluation Complexity

Download Full-text

WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION

Proceedings of the International Congress of Mathematicians (ICM 2018) ◽

10.1142/9789813272880_0198 ◽

2019 ◽

Cited By ~ 1

Author(s):

CORALIA CARTIS ◽

NICHOLAS I. M. GOULD ◽

PHILIPPE L. TOINT

Keyword(s):

Second Order ◽

Worst Case ◽

Case Evaluation ◽

Smooth Optimization ◽

Evaluation Complexity ◽

Second Order Methods

Download Full-text

Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact

Mathematics of Computation ◽

10.1090/mcom/3445 ◽

2019 ◽

Vol 89 (321) ◽

pp. 253-278 ◽

Cited By ~ 2

Author(s):

E. G. Birgin ◽

N. Krejić ◽

J. M. Martínez

Keyword(s):

Minimization Of Functions ◽

Evaluation Complexity

Download Full-text

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

Computational Optimization and Applications ◽

10.1007/s10589-019-00064-2 ◽

2019 ◽

Vol 73 (1) ◽

pp. 1-35

Author(s):

Nicholas I. M. Gould ◽

Tyrone Rees ◽

Jennifer A. Scott

Keyword(s):

Least Squares ◽

Newton Method ◽

Complexity Analysis ◽

Nonlinear Least Squares ◽

Least Squares Problems ◽

Evaluation Complexity

Download Full-text

Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditions and High-Order Models

Approximation and Optimization - Springer Optimization and Its Applications ◽

10.1007/978-3-030-12767-1_2 ◽

2019 ◽

pp. 5-26 ◽

Cited By ~ 1

Author(s):

Coralia Cartis ◽

Nicholas I. M. Gould ◽

Philippe L. Toint

Keyword(s):

Nonlinear Optimization ◽

High Order ◽

Kkt Conditions ◽

Complexity Bounds ◽

Constrained Nonlinear Optimization ◽

Evaluation Complexity

Download Full-text

A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares

Computational and Applied Mathematics ◽

10.1007/s40314-018-0696-1 ◽

2018 ◽

Vol 37 (5) ◽

pp. 6619-6653 ◽

Cited By ~ 2

Author(s):

Hassan Mohammad ◽

Sandra A. Santos

Keyword(s):

Least Squares ◽

Approximation Method ◽

Complexity Analysis ◽

Nonlinear Least Squares ◽

Evaluation Complexity

Download Full-text

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

Foundations of Computational Mathematics ◽

10.1007/s10208-017-9363-y ◽

2017 ◽

Vol 18 (5) ◽

pp. 1073-1107 ◽

Cited By ~ 12

Author(s):

Coralia Cartis ◽

Nick I. M. Gould ◽

Philippe L. Toint

Keyword(s):

Nonlinear Optimization ◽

Second Order ◽

Constrained Nonlinear Optimization ◽

Evaluation Complexity

Download Full-text

evaluation complexity
Recently Published Documents

TOTAL DOCUMENTS

H-INDEX

Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations

High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints

Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization

WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION

Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditions and High-Order Models

A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

Export Citation Format

evaluation complexityRecently Published Documents

TOTAL DOCUMENTS

H-INDEX

Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations

High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints

Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization

WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION

Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditions and High-Order Models

A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

evaluation complexity
Recently Published Documents