Proximal algorithms for a class of abstract convex functions

DOI10.1007/S11228-025-00743-9MaRDI QIDQ7021265zbMATH OpenFDO

Authors Ewa M. Bednarczuk, Dirk A. Lorenz, the Hung Tran

Publication date 28 February 2025

Published in Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11228-025-00743-9

zbMATH Keywords

abstract convexityforward-backward algorithmglobal convergenceproximal operatorproximal subgradient

Mathematics Subject Classification ID

Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
• A regularization method for the proximal point algorithm
• A survey of methods of abstract convex programming
• Abstract Convexity and Augmented Lagrangians
• Abstract convexity of positively homogeneous functions
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Computing proximal points of nonconvex functions
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence of New Inertial Proximal Methods for DC Programming
• Convex analysis and monotone operator theory in Hilbert spaces
• Discrete tomography by convex--concave regularization and D.C. programming
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• Exact and Approximate Solutions of Source Localization Problems
• Generalized Fenchel's conjugation formulas and duality for abstract convex functions
• Geometry and combinatorics of the cutting angle method
• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 5296129 (Why is no real title available?)
• scientific article; zbMATH DE number 1017537 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• Maximum principle in the problem of time optimal response with nonsmooth constraints
• Minimization of non-smooth, non-convex functionals by iterative thresholding
• Minimizing increasing star-shaped functions based on abstract convexity
• Monotone Operators and the Proximal Point Algorithm
• On Distributed Nonconvex Optimization: Projected Subgradient Method for Weakly Convex Problems in Networks
• On duality for nonconvex minimization problems within the framework of abstract convexity
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
• Produits infinis de resolvantes
• Proximal point methods and nonconvex optimization
• Proximité et dualité dans un espace hilbertien
• Quasi-Fejérian analysis of some optimization algorithms
• Resolvent and proximal compositions
• Stochastic model-based minimization of weakly convex functions
• Strong and Weak Convexity of Sets and Functions
• Topical and sub-topical functions, downward sets and abstract convexity

This page was built for publication: Proximal algorithms for a class of abstract convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021265)