A relaxation method for minimizing a smooth function on a generalized spherical segment
From MaRDI portal
Publication:2940367
DOI10.1134/S0965542514020043zbMath1313.65164MaRDI QIDQ2940367
Publication date: 26 January 2015
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
convergencerelaxation methodLipschitz conditiongradient projection methodspherical segmentnonconvex optimization problemtangential cone
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Optimality conditions for minimax problems (49K35)
Related Items (4)
An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface ⋮ Nearly optimal coverings of a sphere with generalized spherical segments ⋮ Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set ⋮ Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
Cites Work
This page was built for publication: A relaxation method for minimizing a smooth function on a generalized spherical segment