An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint

Gregorio M. Sempere
  • Fonction : Auteur
  • PersonId : 1313412

Résumé

Modern optimization problems from stochastic optimization, machine learning, uncertainty quantification, and others often involve functions that fail to be smooth and convex. Nevertheless, many such problems possess some structure that can and should be exploited in numerical optimization. This work investigates implementable necessary optimality conditions for a broad class of nonsmooth and nonconvex optimization problems involving objective and constraint functions that can be expressed as a finite sum of pointwise maxima of finitely many weakly-concave functions. Such a setting is general enough to accommodate nonconvex reliability-based optimization problems for which mathematically sound algorithms are scarce. Application areas include energy management, electric power systems, transportation, engineering design, and manufacturing. Our main contribution is a proximal-type algorithm with convergence guarantees to critical points. Our approach does not require penalization nor a feasible initial point. Numerical experiments on some stochastic reliability-based optimization problems illustrate the practical performance of the method.
Fichier non déposé

Dates et versions

hal-04300004 , version 1 (22-11-2023)

Identifiants

  • HAL Id : hal-04300004 , version 1

Citer

Welington de Oliveira, Gregorio M. Sempere. An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint. PGMO DAYS 2023, Nov 2023, Paris, France. ⟨hal-04300004⟩
53 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More