On the complexity of the steepest-descent with exact linesearches

Original language	English
Publisher	FUNDP. Namur center for complex systems
Publication status	Published - 2012

Publication series

Name	NAXYS Technical Report
Publisher	Department of Mathematics
Volume	16-2012

Access to Document

• 74919Accepted author manuscript, 808 KB

Research output

Research output per year 2013 2013 2015 2017 2018 2020 2022 2022

• 3 Article
• 3 Working paper
• 1 Book

Research output per year

Research output per year

• Evaluation complexity of algorithms for nonconvex optimization

  Cartis, C., Gould, N. I. M. & TOINT, P., Jul 2022, SIAM. 600 p. (SIAM-MOS Series on Optimization)

  Research output: Book/Report/Journal › Book

• Adaptive regularization algorithms with inexact evaluations for nonconvex optimization

  Bellavia, S., Gurioli, G., Morini, B. & Toint, P., 2 Jan 2020, In: SIAM Journal on Optimization. 29, 4, p. 2881-2915 35 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  File

  • Adaptive Mechanism 100%
  28 Downloads (Pure)

• Second-order optimality and beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

  Cartis, C., Gould, N. I. M. & Toint, P., 1 Oct 2018, In: Foundations of Computational Mathematics. 18, 5, p. 1073-1107 35 p.

  Research output: Contribution to journal › Article › peer-review

  • Evaluation 100%
  • Complexity 100%
  • Optimality 100%
  • Critical Point 75%
  • Algorithms 50%

View all 7 research outputs

Projects

Projects per year 1987 1987 2008 2008

• 2 Active

Projects per year

• Complexity in nonlinear optimization

  TOINT, P., Gould, N. I. M. & Cartis, C.

  1/11/08 → …

  Project: Research

  • Complexity 100%
  • Evaluation 65%
  • Algorithms 50%
  • Order 48%
  • Regularization 29%

• ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization

  Sartenaer, A. & TOINT, P.

  1/01/87 → …

  Project: Research Axis

  • Algorithms 100%
  • Algorithm 71%
  • Complexity 64%
  • Nonlinear 61%
  • Order 46%

Activities

Activities per year 2015 2015 2016 2016

• 1 Oral presentation
• 1 Research/Teaching in a external institution
• 1 Visiting an external academic institution

Activities per year

• Polytechnic University of Hong Kong

  Philippe Toint (Visiting researcher)

  31 Jan 2016 → 14 Feb 2016

  Activity: Visiting an external institution types › Research/Teaching in a external institution

• How much patience do you have? Issues in complexity for nonlinear optimization

  Philippe Toint (Invited speaker)

  27 Nov 2015

  Activity: Talk or presentation types › Oral presentation

• University of Oxford

  Philippe Toint (Visiting researcher)

  Sept 2015 → Dec 2015

  Activity: Visiting an external institution types › Visiting an external academic institution

Cite this

• APA
• Author
• BIBTEX
• Harvard
• Standard
• RIS
• Vancouver

Cartis, C., Gould, N. I. M., & Toint, P. (2012). On the complexity of the steepest-descent with exact linesearches. (NAXYS Technical Report; Vol. 16-2012). FUNDP. Namur center for complex systems.

Cartis, Coralia ; Gould, N. I. M. ; Toint, Philippe. / On the complexity of the steepest-descent with exact linesearches. FUNDP. Namur center for complex systems, 2012. (NAXYS Technical Report).

@book{b984c4c8aa584242a5f37e0d28428003,

title = "On the complexity of the steepest-descent with exact linesearches",

author = "Coralia Cartis and Gould, {N. I. M.} and Philippe Toint",

year = "2012",

language = "English",

series = "NAXYS Technical Report",

publisher = "FUNDP. Namur center for complex systems",

}

Cartis, C, Gould, NIM & Toint, P 2012, On the complexity of the steepest-descent with exact linesearches. NAXYS Technical Report, vol. 16-2012, FUNDP. Namur center for complex systems.

On the complexity of the steepest-descent with exact linesearches. / Cartis, Coralia; Gould, N. I. M.; Toint, Philippe.
FUNDP. Namur center for complex systems, 2012. (NAXYS Technical Report; Vol. 16-2012).

Research output: Book/Report/Journal › Other report

TY - BOOK

T1 - On the complexity of the steepest-descent with exact linesearches

AU - Cartis, Coralia

AU - Gould, N. I. M.

AU - Toint, Philippe

PY - 2012

Y1 - 2012

M3 - Other report

T3 - NAXYS Technical Report

BT - On the complexity of the steepest-descent with exact linesearches

PB - FUNDP. Namur center for complex systems

ER -

Cartis C, Gould NIM, Toint P. On the complexity of the steepest-descent with exact linesearches. FUNDP. Namur center for complex systems, 2012. (NAXYS Technical Report).