scientific article; zbMATH DE number 7118229

Publication date: 16 October 2019

Full work available at URL: http://www.heldermann.de/JCA/JCA26/JCA263/jca26043.htm#jca263

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

optimization error bounds proximal average almost convexity near convexity near equality

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
On the maximal domain of a monotone function
Inequality systems and optimization
Fenchel's duality theorem for nearly convex functions
Strong duality for generalized convex optimization problems
Duality for almost convex optimization problems via the perturbation approach
Partially finite convex programming. I: Quasi relative interiors and duality theory
Image d'une somme d'opérateurs monotones et applications
Error bounds for analytic systems and their applications
Error bounds in mathematical programming
Projection and proximal point methods: Convergence results and counterexamples.
Asymptotic constraint qualifications and global error bounds for convex inequalities.
On error bounds for lower semicontinuous functions.
Lagrangian duality and cone convexlike functions
Duality and stability in extremum problems involving convex functions
Weak sharp minima revisited. II: Application to linear regularity and error bounds
Calmness of constraint systems with applications
Error Bounds for Lower Semicontinuous Functions in Normed Spaces
Weak Sharp Minima in Mathematical Programming
Duality in Vector Optimization
The Proximal Average: Basic Theory
An Application of Error Bounds for Convex Programming in a Linear Space
Monotone Operators and the Proximal Point Algorithm
Variational Analysis
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
On Projection Algorithms for Solving Convex Feasibility Problems
On the Convexity of the Value Function for a Class of Nonconvex Variational Problems: Existence and Optimality Conditions
How to Transform One Convex Function Continuously into Another
Proximité et dualité dans un espace hilbertien
Convex Analysis
Quasiconvex Sets
Abstract convexity and global optimization

This page was built for publication: