Related Experiment Video
Updated: Oct 3, 2025

Dissection, MicroCT Scanning and Morphometric Analyses of the Baculum
Published on: March 19, 2017
An extension of the proximal point algorithm beyond convexity
Sorin-Mihai Grad1, Felipe Lara2
1Faculty of Mathematics, University of Vienna, Oskar-Morgenstern-Platz 1, A-1090 Vienna, Austria.
Abstract:
We introduce and investigate a new generalized convexity notion for functions called prox-convexity. The proximity operator of such a function is single-valued and firmly nonexpansive. We provide examples of (strongly) quasiconvex, weakly convex, and DC (difference of convex) functions that are prox-convex, however none of these classes fully contains the one of prox-convex functions or is included into it. We show that the classical proximal point algorithm remains convergent when the convexity of the proper lower semicontinuous function to be minimized is relaxed to prox-convexity.
Related Concept Videos
Maximum Deflection
The maximum deflection occurs at a specific point, known as point O, where the tangent to the deflection curve is horizontal. To find point O, the slope of the tangent at any...
Castigliano's Theorem: Problem Solving
Divergence and Stokes' Theorems
Elevation of Intermediate Points on Vertical Curves
Deformations in a Symmetric Member in Bending
When the member is segmented into tiny cubic elements, it is observed that the primary stress...
Perpendicular-Axis Theorem
Consider a circular disc of mass M and radius R lying along an x-y plane. The origin lies at the center of the disc, and the z-axis is perpendicular to the disc's plane. All three axes coincide at the disc's center. The moment of inertia of this...

