The gradient projection method for a supporting function on the unit sphere and its applications
From MaRDI portal
(Redirected from Publication:6552607)
Recommendations
- On some problems with multivalued mappings
- Sufficient conditions for the linear convergence of an algorithm for finding the metric projection of a point onto a convex compact set
- scientific article; zbMATH DE number 6731404
- Three-step method of gradient projection for minimization problems
- A gradient projection method on an embedding of the feasible set
Cites work
- An algorithm for projecting a point onto a level set of a quadratic function
- An algorithm for the numerical solution of linear differential games
- Compact convex projections
- Dynamics and control of trajectory tubes. Theory and computation
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- Geometry of Banach spaces. Selected topics
- Gradient projection and conditional gradient methods for constrained nonconvex minimization
- scientific article; zbMATH DE number 996866 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 3776349 (Why is no real title available?)
- scientific article; zbMATH DE number 3807538 (Why is no real title available?)
- scientific article; zbMATH DE number 3272538 (Why is no real title available?)
- scientific article; zbMATH DE number 3039539 (Why is no real title available?)
- Integrals of set-valued functions
- Interior sphere property of attainable sets and time optimal control problems
- Local characterization of strongly convex sets
- Maximization of a function with Lipschitz continuous gradient
- Methods for solving a smooth linear time-optimal problem
- Metric regularity -- a survey. I: Theory
- On the convexity of integrals of multivalued mappings. Applications in control theory
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Reachability analysis of linear systems using support functions
- Second order discrete approximations to strongly convex differential inclusions
- Smallest Ellipsoid Containing $p$-Sum of Ellipsoids With Application to Reachability Analysis
- Strong and Weak Convexity of Sets and Functions
- Strongly convex analysis
- Sufficient conditions for the linear convergence of an algorithm for finding the metric projection of a point onto a convex compact set
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- The Strong Convexity Supporting Condition and the Lipschitz Condition for the Metric Projection
- Uniform convexity and the splitting problem for selections
- Uniformly convex subsets of the Hilbert space with modulus of convexity of the second order
Cited in
(3)
This page was built for publication: The gradient projection method for a supporting function on the unit sphere and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552607)