English
Related papers

Related papers: Minimax-optimal Halpern iterations for Lipschitz m…

200 papers

A hypodifferential is a compact family of affine mappings that defines a local max-type approximation of a nonsmooth convex function. We present a general theory of hypodifferentials of nonsmooth convex functions defined on a Banach space.…

Optimization and Control · Mathematics 2025-03-28 M. V. Dolgopolik

We present a novel method for mixed-integer optimization problems with multivariate and Lipschitz continuous nonlinearities. In particular, we do not assume that the nonlinear constraints are explicitly given but that we can only evaluate…

Optimization and Control · Mathematics 2023-03-22 Julia Grübel , Richard Krug , Martin Schmidt , Winnifried Wollner

We find a priori and a posteriori error estimates of the best proximity point for the Picard iteration associated to a cyclic contraction map, which is defined on a uniformly convex Banach space with modulus of convexity of power type. We…

Functional Analysis · Mathematics 2016-05-17 Boyan Zlatanov

The gradient method for minimize a differentiable convex function on Riemannian manifolds with lower bounded sectional curvature is analyzed in this paper. The analysis of the method is presented with three different finite procedures for…

Optimization and Control · Mathematics 2018-06-08 O. P. Ferreira , M. S. Louzeiro , L. F. Prudente

This paper is devoted to the proof of Lipschitz regularity, down to the microscopic scale, for solutions of an elliptic system with highly oscillating coefficients, over a highly oscillating Lipschitz boundary. The originality of this…

Analysis of PDEs · Mathematics 2015-04-08 Carlos Kenig , Christophe Prange

We study the iteration complexity of Lipschitz convex optimization problems satisfying a general error bound. We show that for this class of problems, subgradient descent with either Polyak stepsizes or decaying stepsizes achieves minimax…

Optimization and Control · Mathematics 2025-12-17 Alex L. Wang

The subgradient method is one of the most fundamental algorithmic schemes for nonsmooth optimization. The existing complexity and convergence results for this method are mainly derived for Lipschitz continuous objective functions. In this…

Optimization and Control · Mathematics 2024-11-01 Xiao Li , Lei Zhao , Daoli Zhu , Anthony Man-Cho So

We consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the…

Numerical Analysis · Mathematics 2021-02-18 Alexander Haberl , Dirk Praetorius , Stefan Schimanko , Martin Vohralik

We provide some necessary and sufficient conditions for a proper lower semicontinuous convex function, defined on a real Banach space, to be locally or globally Lipschitz continuous. Our criteria rely on the existence of a bounded selection…

Functional Analysis · Mathematics 2019-11-13 Bao Tran Nguyen , Pham Duy Khanh

The steepest descent method for multiobjective optimization on Riemannian manifolds with lower bounded sectional curvature is analyzed in this paper. The aim of the paper is twofold. Firstly, an asymptotic analysis of the method is…

Optimization and Control · Mathematics 2019-06-17 Orizon P. Ferreira , Maurício S. Louzeiro , Leandro F. Prudente

In this note, at first we prove that the existence of best proximity points for cyclic relatively nonexpansive mappings is equivalent to the existence of best proximity pairs for noncyclic relatively nonexpansive mappings in the setting of…

Functional Analysis · Mathematics 2019-07-09 Moosa Gabeleh , Hans-Peter A. Künzi

Let $X$ be a real Banach space with a normalized duality mapping uniformly norm-to-weak$^\star$ continuous on bounded sets or a reflexive Banach space which admits a weakly continuous duality mapping $J_{\Phi}$ with gauge $\phi$. Let $f$ be…

Optimization and Control · Mathematics 2007-12-10 Jean-Philippe Chancelier

This study presents an effective global optimization technique designed for multivariate functions that are H\"older continuous. Unlike traditional methods that construct lower bounding proxy functions, this algorithm employs a…

Machine Learning · Computer Science 2023-03-28 Kaan Gokcesu , Hakan Gokcesu

We present a framework for performing efficient regression in general metric spaces. Roughly speaking, our regressor predicts the value at a new point by computing a Lipschitz extension --- the smoothest function consistent with the…

Machine Learning · Computer Science 2017-04-25 Lee-Ad Gottlieb , Aryeh Kontorovich , Robert Krauthgamer

This note establishes a theoretical framework for finding (potentially overparameterized) approximations of a function on a compact set with a-priori bounds for the generalization error. The approximation method considered is to choose,…

Systems and Control · Electrical Eng. & Systems 2026-03-23 Arthur C. B. de Oliveira , Ruigang Wang , Ian R. Manchester , Eduardo D. Sontag

This paper considers a stochastic optimization problem over the fixed point sets of quasinonexpansive mappings on Riemannian manifolds. The problem enables us to consider Riemannian hierarchical optimization problems over complicated sets,…

Optimization and Control · Mathematics 2020-12-18 Hideaki Iiduka , Hiroyuki Sakai

This paper addresses a class of nonsmooth and nonconvex optimization problems defined on complete Riemannian manifolds. The objective function has a composite structure, combining convex, differentiable, and lower semicontinuous terms,…

Optimization and Control · Mathematics 2025-11-19 Vitaliano S. Amaral , Marcio Antônio de A. Bortoloti , Jurandir O. Lopes , Gilson N. Silva

We study the inverse boundary value problem for the Helmholtz equation using the Dirichlet-to-Neumann map at selected frequency as the data. We develop an explicit reconstruction of the wavespeed using a multi-level nonlinear projected…

Numerical Analysis · Mathematics 2014-06-11 Elena Beretta , Maarten V. de Hoop , Lingyun Qiu , Otmar Scherzer

In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…

Optimization and Control · Mathematics 2026-05-05 TaeHo Yoon , Benjamin Grimmer

We propose a method to remedy finite sample coverage problems and improve upon the efficiency of commonly employed procedures for the construction of nonparametric confidence intervals in regression kink designs. The proposed interval is…

Econometrics · Economics 2021-11-23 Majed Dodin