Related Experiment Video
Updated: Mar 8, 2026

Visualization Method for Proprioceptive Drift on a 2D Plane Using Support Vector Machine
Published on: October 27, 2016
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization
1College of Science, Civil Aviation University of China, Tianjin, 300300 China ; Tianjin Key Laboratory for Advanced Signal Processing, Civil Aviation University of China, Tianjin, 300300 China.
Abstract:
Let H be a real Hilbert space and C be a nonempty closed convex subset of H. Assume that g is a real-valued convex function and the gradient ∇g is [Formula: see text]-ism with [Formula: see text]. Let [Formula: see text], [Formula: see text]. We prove that the sequence [Formula: see text] generated by the iterative algorithm [Formula: see text], [Formula: see text] converges strongly to [Formula: see text], where [Formula: see text] is the minimum-norm solution of the constrained convex minimization problem, which also solves the variational inequality [Formula: see text], [Formula: see text]. Under suitable conditions, we obtain some strong convergence theorems. As an application, we apply our algorithm to solving the split feasibility problem in Hilbert spaces.
Related Concept Videos
Optimization Problems
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Gaussian Elimination: Problem Solving
Application of Nonlinear Inequalities
Application of Linearization and Approximation
Residuals and Least-Squares Property
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...

