Maximization of a function with Lipschitz continuous gradient

DOI10.1007/s10958-015-2482-6zbMath1369.90165OpenAlexW1182900613MaRDI QIDQ267587

Maxim V. Balashov

Publication date: 11 April 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-015-2482-6

zbMATH Keywords

projection algorithmunique solutionproximally smooth

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (9)

An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation ⋮ Stability of minimization problems and the error bound condition ⋮ Gradient methods on strongly convex feasible sets and optimal control of affine systems ⋮ The Lipschitz property of the metric projection in the Hilbert space ⋮ The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient ⋮ The Pliś metric and Lipschitz stability of minimization problems ⋮ Unnamed Item ⋮ The gradient projection algorithm for smooth sets and functions in nonconvex case ⋮ Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About the Lipschitz property of the metric projection in the Hilbert space
• On p-convex sets and geodesics
• Local differentiability of distance functions
• Weakly convex and proximally smooth sets in Banach spaces

This page was built for publication: Maximization of a function with Lipschitz continuous gradient