Enclosing minima in nonsmooth optimization via trust regions of higher-order cutting-plane models

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Gebken, Bennet, Ulbrich, Michael
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917360692101120
author Gebken, Bennet
Ulbrich, Michael
author_facet Gebken, Bennet
Ulbrich, Michael
contents We propose a globally convergent trust-region bundle method for minimizing lower-$C^2$ functions using higher-order cutting-plane models. Under certain growth assumptions on the objective around its minimum, the method is able to compute infinitely many trust regions of decreasing size that contain the minimum. We show that these growth assumptions are satisfied for certain finite max-type functions with sharp or quadratic growth. Enclosing the minimum in this way can be used to initialize local superlinearly convergent methods, which we demonstrate in numerical experiments.
format Preprint
id arxiv_https___arxiv_org_abs_2603_23261
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Enclosing minima in nonsmooth optimization via trust regions of higher-order cutting-plane models
Gebken, Bennet
Ulbrich, Michael
Optimization and Control
We propose a globally convergent trust-region bundle method for minimizing lower-$C^2$ functions using higher-order cutting-plane models. Under certain growth assumptions on the objective around its minimum, the method is able to compute infinitely many trust regions of decreasing size that contain the minimum. We show that these growth assumptions are satisfied for certain finite max-type functions with sharp or quadratic growth. Enclosing the minimum in this way can be used to initialize local superlinearly convergent methods, which we demonstrate in numerical experiments.
title Enclosing minima in nonsmooth optimization via trust regions of higher-order cutting-plane models
topic Optimization and Control
url https://arxiv.org/abs/2603.23261