In this letter, a formulation of Fermat's principle as an optimization problem over a finite number of stages is used to prove strong convexity and smoothness of the solutions to certain geometric optics problems. The class of problems considered in this letter consists in the determination of the trajectory followed by a ray between a light source and a final fixed point, separated by a finite number of layered homogeneous media, characterized by their refractive indices. To obtain the theoretical results, a dynamic programming argument is used in the analysis. Then, strong convexity and smoothness are exploited to get an error bound valid when an exact solution is replaced by an approximate solution. Numerical results are provided to validate the theoretical achievements.

Strong convexity and smoothness of solutions to geometric optics problems via dynamic programming

G. Gnecco;
2018-01-01

Abstract

In this letter, a formulation of Fermat's principle as an optimization problem over a finite number of stages is used to prove strong convexity and smoothness of the solutions to certain geometric optics problems. The class of problems considered in this letter consists in the determination of the trajectory followed by a ray between a light source and a final fixed point, separated by a finite number of layered homogeneous media, characterized by their refractive indices. To obtain the theoretical results, a dynamic programming argument is used in the analysis. Then, strong convexity and smoothness are exploited to get an error bound valid when an exact solution is replaced by an approximate solution. Numerical results are provided to validate the theoretical achievements.
File in questo prodotto:
File Dimensione Formato  
08371616.pdf

non disponibili

Tipologia: Versione Editoriale (PDF)
Licenza: Nessuna licenza
Dimensione 517.99 kB
Formato Adobe PDF
517.99 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11771/11071
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
social impact