A Globally Convergent Run-to-run Control Algorithm with Improved Rate of Convergence

Dominique Bonvin, Grégory François
2005
Conference Papers

Official source

About
Privacy
Disclaimer

Graph Chatbot

Dominique Bonvin, Grégory François
2005
Conference Papers

Official source

Related publications (14)

https://infoscience.epfl.ch/entities/publication/19405dd3-fdc5-41bc-b542-ec7162d1c795

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (14)

First and Zeroth-Order Implementations of the Regularized Newton Method with Lazy Approximated Hessians

Nikita Doikov

In this work, we develop first-order (Hessian-free) and zeroth-order (derivative-free) implementations of the Cubically Regularized Newton Method for solving general non-convex optimization problems. For that, we employ finite difference approximations of ...

SPRINGER/PLENUM PUBLISHERS2025

Fast convergence to non-isolated minima: four equivalent conditions for C2 functions

Nicolas Boumal, Quentin Rebjock

Optimization algorithms can see their local convergence rates deteriorate when the Hessian at the optimum is singular. These singularities are inescapable when the optima are non-isolated. Yet, under the right circumstances, several algorithms preserve the ...

2024

Spectral Coarse Spaces for the Substructured Parallel Schwarz Method

Tommaso Vanzan

The parallel Schwarz method (PSM) is an overlapping domain decomposition (DD) method to solve partial differential equations (PDEs). Similarly to classical nonoverlapping DD methods, the PSM admits a substructured formulation, that is, it can be formulated ...

2022