The backtrack Hölder gradient method with application to min-max and min-min problems
We present a new algorithm to solve min-max or min-min problems out of the convex world. We use rigidity assumptions, ubiquitous in learning, making our method – the backtrack Hölder algorithm applicable to many optimization problems. Our approach takes advantage of hidden regularity properties and...
Saved in:
Main Authors: | Bolte, Jérôme, Glaudin, Lilian, Pauwels, Edouard, Serrurier, Mathieu |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2023-12-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.24/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A REPRESENTATION OF ZAINICHI AS SUBALTERNS IN MIN JIN LEE’S PACHINKO: POSTCOLONIAL STUDIES
by: Ayu Susilawati, et al.
Published: (2024-08-01) -
Transcriptomics-based investigation of resistance differences to swine fever between large white pigs and min pigs
by: Jia Li, et al.
Published: (2025-03-01) -
The Right to the Night City: Exploring the Temporal Variability of the 15-min City in Milan and Its Implications for Nocturnal Communities
by: Lamia Abdelfattah, et al.
Published: (2025-01-01) -
Fault aware task scheduling in cloud using min-min and DBSCAN
by: S.M.F D Syed Mustapha, et al.
Published: (2024-01-01) -
Max-Min Fair Link Quality in WSN Based on SINR
by: Ada Gogu, et al.
Published: (2014-01-01)