English
Related papers

Related papers: Proximal determination of convex functions

200 papers

Recently, various high-order methods have been developed to solve the convex optimization problem. The auxiliary problem of these methods shares the general form that is the same as the high-order proximal operator proposed by Nesterov. In…

Optimization and Control · Mathematics 2023-09-06 Jingyu Gao , Xiurui Geng

This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…

Optimization and Control · Mathematics 2026-03-11 Hòa T. Bùi , Minh N. Bùi , Christian Clason

We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of…

Optimization and Control · Mathematics 2024-11-21 Hanyang Li , Ying Cui

This paper proves comparison principles for elliptic PDE involving the Finsler infinity Laplacian, a second-order differential operator with discontinuities in the gradient variable arising in $L^{\infty}$-variational problems and…

Analysis of PDEs · Mathematics 2024-05-10 Peter S. Morfe

We prove novel convergence results for a stochastic proximal gradient algorithm suitable for solving a large class of convex optimization problems, where a convex objective function is given by the sum of a smooth and a possibly non-smooth…

Optimization and Control · Mathematics 2016-08-11 Lorenzo Rosasco , Silvia Villa , Bang Công Vũ

We present one of the approaches to find the best approximation of the given function by trigonometric polynomials in $L^1$ metric and applied it to find the optimal constants in the Nikolsky's type inequality, concerning approximation of…

Numerical Analysis · Mathematics 2016-07-19 Alexey Solyanik

In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…

Optimization and Control · Mathematics 2019-08-22 James V. Burke , Tim Hoheisel , Quang V. Nguyen

The classical Hahn-Banach theorem is based on a successive point-by-point procedure of extending bounded linear functionals. In the setting of a general metric domain, the conditions are less restrictive and the extension is only required…

General Topology · Mathematics 2020-02-19 Valentin Gutev

Recently, Simons provided a lemma for a support function of a closed convex set in a general Hilbert space and used it to prove the geometry conjecture on cycles of projections. In this paper, we extend Simons's lemma to closed convex…

Functional Analysis · Mathematics 2022-02-23 Heinz H. Bauschke , Xianfu Wang

The present article deals with the local approximation results by means of Lipschitz maximal function, Ditzian-Totik modulus of smoothness and Lipschitz type space having two parameters for the summation-integral type operators defined by…

Functional Analysis · Mathematics 2019-12-11 Rishikesh Yadav , Ramakanta Meher , Vishnu Narayan Mishra

In this paper we consider stochastic composite convex optimization problems with the objective function satisfying a stochastic bounded gradient condition, with or without a quadratic functional growth property. These models include the…

Optimization and Control · Mathematics 2020-03-10 Ion Necoara

We show a norm convergence result for the Laplacian on a class of post-critically finite fractals with arbitrary Borel regular probability measure which can be approximated by a sequence of finite-dimensional graph Laplacians with…

Spectral Theory · Mathematics 2018-09-10 Olaf Post , Jan Simmer

On any metric space, I provide an intrinsic characterization of those complex-valued functions which are uniform limits of Lipschitz functions. There are applications to function theory on complete Riemannian manifolds and, in particular,…

Functional Analysis · Mathematics 2021-05-18 L. A. Coburn

We show that the deviation between the slopes of two convex functions controls the deviation between the functions themselves. This result reveals that the slope -- a one dimensional construct -- robustly determines convex functions, up to…

Optimization and Control · Mathematics 2023-03-30 Aris Daniilidis , Dmitriy Drusvyatskiy

We propose a novel study of the stochastic proximal gradient method for minimizing the sum of two convex functions, one of which is smooth. Under suitable assumptions and without requiring any boundedness or control of the variance of the…

Optimization and Control · Mathematics 2026-04-16 Javier I. Madariaga

Replacing operators with continuous operator-valued functions, we prove time-dependent versions of well-known results on compressions and diagonals of bounded operators. The setting of smooth functions is also addressed. Our results have no…

Functional Analysis · Mathematics 2025-12-18 Vladimir Müller , Yuri Tomilov

We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…

Optimization and Control · Mathematics 2022-03-29 Hui Ouyang

We introduce a proximal subdifferential and develop a calculus for nonsmooth functions defined on any Riemannian manifold $M$. We give several applications of this theory, concerning: 1) differentiability and geometrical properties of the…

Differential Geometry · Mathematics 2007-05-23 Daniel Azagra , Juan Ferrera

Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the…

Numerical Analysis · Mathematics 2016-11-15 Nira Dyn , Uri Itai , Nir Sharon

We give an elementary proof of a somewhat curious result, namely, that deciding whether a convex function is self-concordant is in general an intractable problem.

Optimization and Control · Mathematics 2013-04-01 Lek-Heng Lim