Skip to content
  • Publications
  • Jobs
  • enzuazua
  • Seminars
  • Events Calendar
  • Home
  • About us
    • About the Chair
    • Head of the Chair
    • Team
    • Past Members
  • Research
    • Projects
    • ERC – DyCon
    • DyCon Blog
    • DyCon Toolbox
    • Industrial & Social TransferenceContents related to the industrial and social transference aspects of the work in the Chair of Computational Mathematics.
  • Publications
    • Publications (All)
    • Publications Relased
      • Publications 2022
      • Publications 2021
      • Publications 2020
      • Publications 2019
      • Publications 2018
      • Publications 2017
      • Publications 2016
    • AcceptedAccepted to be released
    • SubmittedSubmitted publications
  • Activities
    • Events calendar
    • Past Events
    • News
    • Seminars
    • Courses
    • enzuazua
    • Gallery
  • Jobs
  • Contact

Greedy search of optimal approximate solutions

M. Lazar, E. Zuazua. Greedy search of optimal approximate solutions (2022)

Abstract. In this paper we develop a procedure to deal with a family of parameter-dependent ill-posed problems, for which the exact solution in general does not exist. The original problems are relaxed by considering corresponding approximate ones, whose optimal solutions are well defined, where the optimality is determined by the minimal norm requirement. The procedure is based upon greedy algorithms that preserve, at least asymptotically, Kolmogorov approximation rates. In order to provide a-priori estimates for the algorithm, a Tychonoff-type regularization is applied, which adds an additional parameter to the model. The theory is developed in an abstract theoretical framework that allows its application to different kinds of problems. We present a specific example that considers a family of ill-posed elliptic problems.
The required general assumptions in this case translate to rather natural uniform lower and upper bounds on coefficients of the considered operators.

Read Full Paper

Last updated on March 17, 2022

Post navigation

Previous Post
II [B_1^-] Short-course: Control and Machine Learning by E. Zuazua II [B_1^-] Short-course: Control and Machine Learning by E. Zuazua
Next Post
The Disk Multiplier and the Spherical Maximal Operator The Disk Multiplier and the Spherical Maximal Operator

Last Publications

Nonuniqueness of minimizers for semilinear optimal control problems

The turnpike property and the long-time behavior of the Hamilton-Jacobi-Bellman equation for finite-dimensional LQ control problems

A framework for randomized time-splitting in linear-quadratic optimal control

Numerical Control: Part A

Numerical hypocoercivity for the Kolmogorov equation

  • Mini-Workshop “Calculus of Variations and Functional Inequalities”
  • Protected: Model Predictive Control with Random Batch Method for Linear-Quadratic Optimal Control: Introduction and Matlab Implementation
  • Benasque Workshop-Summer School: PDE’s, Optimal Design and Numerics
  • A framework for randomized time-splitting in linear-quadratic optimal control
  • Nonuniqueness of minimizers for semilinear optimal control problems
Copyright 2016 - 2022 — . All rights reserved. Chair of Computational Mathematics, Deusto Foundation - University of Deusto
Scroll to Top
  • Aviso Legal
  • Política de Privacidad
  • Política de Cookies
  • Configuración de Cookies
WE USE COOKIES ON THIS SITE TO ENHANCE USER EXPERIENCE. We also use analytics. By navigating any page you are giving your consent for us to set cookies.    more information
Privacidad