Abstract
The minimization of a smooth functional on a generalized spherical segment of a finite-dimensional Euclidean space is examined. A relaxation method that involves successive projections of the antigradient onto auxiliary sets of a simpler structure is proposed. It is shown that, under certain natural assumptions, this method converges to a stationary point.
Similar content being viewed by others
References
V. I. Zabotin and Yu. A. Chernyaev, “A generalization of the gradient projection method to extremum value problems with preconvex constraints,” Comput. Math. Math. Phys. 41, 340–346 (2001).
Yu. A. Chernyaev, “Convergence of the gradient projection method for a class of nonconvex mathematical programming problems,” Russ. Math. 49(12), 71–74 (2005).
T. F. Minnibaev and Yu. A. Chernyaev, “Iterative algorithm for mathematical programming problems with preconvex constraints,” Comput. Math. Math. Phys. 50, 792–794 (2010).
V. I. Zabotin and Yu. A. Chernyaev, “Convergence of an iterative method for a programming problem with constraints in the form of a convex smooth surface,” Comput. Math. Math. Phys. 44, 575–578 (2004).
F. P. Vasil’ev, Optimization Methods (Faktorial, Moscow, 2002) [in Russian].
A. M. Dulliev and V. I. Zabotin, “Iteration algorithm for projecting a point on a nonconvex manifold in a normed linear space,” Comput. Math. Math. Phys. 44, 781–784 (2004).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.M. Dulliev, 2014, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2014, Vol. 54, No. 2, pp. 208–223.
Rights and permissions
About this article
Cite this article
Dulliev, A.M. A relaxation method for minimizing a smooth function on a generalized spherical segment. Comput. Math. and Math. Phys. 54, 219–234 (2014). https://doi.org/10.1134/S0965542514020043
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542514020043