scientific article; zbMATH DE number 6731404

zbMath1375.46056MaRDI QIDQ5269141

Maxim V. Balashov

Publication date: 15 June 2017

Full work available at URL: http://www.heldermann.de/JCA/JCA24/JCA242/jca24031.htm#jca242

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

zbMATH Keywords

Hilbert spacegradient projection algorithmcontinuous optimizationLipschitz continuous gradientproximally smooth set with constant \(R\)strongly convex set of radius \(r\)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Convexity of real functions of several variables, generalizations (26B25) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)

Related Items (13)

Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds ⋮ Stability of minimization problems and the error bound condition ⋮ Rectifiable curves in proximally smooth sets ⋮ The Lipschitz property of the metric projection in the Hilbert space ⋮ Gradient projection method on matrix manifolds ⋮ On the gradient projection method for weakly convex functions on a proximally smooth set ⋮ The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The gradient projection algorithm for smooth sets and functions in nonconvex case ⋮ Characterization of solutions of strong-weak convex programming problems ⋮ Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization ⋮ Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set

This page was built for publication: