The gradient projection method for a supporting function on the unit sphere and its applications
From MaRDI portal
Publication:6552607
DOI10.1134/s096554252470009xzbMath1548.49017MaRDI QIDQ6552607
Maxim V. Balashov, A. A. Tremba
Publication date: 10 June 2024
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
nonsmooth analysisset-valued integraluniform convexitygradient projection methodstrong convexitysum of ellipsoids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximization of a function with Lipschitz continuous gradient
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Dynamics and control of trajectory tubes. Theory and computation
- Uniformly convex subsets of the Hilbert space with modulus of convexity of the second order
- Uniform convexity and the splitting problem for selections
- Methods for solving a smooth linear time-optimal problem
- Reachability analysis of linear systems using support functions
- On the convexity of integrals of multivalued mappings. Applications in control theory
- Geometry of Banach spaces. Selected topics
- Second order discrete approximations to strongly convex differential inclusions
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- Local characterization of strongly convex sets
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- Integrals of set-valued functions
- METRIC REGULARITY—A SURVEY PART 1. THEORY
- Strong and Weak Convexity of Sets and Functions
- Strongly convex analysis
- Interior sphere property of attainable sets and time optimal control problems
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- An algorithm for the numerical solution of linear differential games
- Smallest Ellipsoid Containing $p$-Sum of Ellipsoids With Application to Reachability Analysis
- An algorithm for projecting a point onto a level set of a quadratic function
- Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
- Sufficient conditions for the linear convergence of an algorithm for finding the metric projection of a point onto a convex compact set
- The Strong Convexity Supporting Condition and the Lipschitz Condition for the Metric Projection
This page was built for publication: The gradient projection method for a supporting function on the unit sphere and its applications