Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
From MaRDI portal
Publication:830954
DOI10.1134/S0965542521020068zbMath1467.90072OpenAlexW3159224367MaRDI QIDQ830954
Publication date: 10 May 2021
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542521020068
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
- Some continuous methods for solving quasi-variational inequalities
- On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions
- A regularized continuous extragradient method of the first order with a variable metric for problems of equilibrium programming
- On three-step regularized method of gradient projection for solving of minimization problems with inaccurrate initial data
- Barrier-projective methods for nonlinear programming
- Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
- Solution of ill-posed nonconvex optimization problems with accuracy proportional to the error in input data
- A fast gradient projection method for a constrained fractional optimal control
This page was built for publication: Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
