Pages that link to "Item:Q2314191"
From MaRDI portal
The following pages link to Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set (Q2314191):
Displaying 11 items.
- 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 (Q506226) (← links)
- On equivalence between optimality criteria and projected gradient methods with application to topology optimization problem (Q812990) (← links)
- Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface (Q830954) (← links)
- An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface (Q901844) (← links)
- A minmax bound on the position of the plane tangent to the constraints in an optimization problem (Q1395028) (← links)
- A generalization of the gradient projection method to extremal problems with preconvex constraints. (Q1395322) (← links)
- The gradient projection algorithm for smooth sets and functions in nonconvex case (Q2045187) (← links)
- Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set (Q2278194) (← links)
- Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface (Q2679082) (← links)
- Newton's method for optimization problems with a convex smooth surface as a constraint (Q2901142) (← links)
- Conditional gradient method for optimization problems with a constraint in the form of the intersection of a convex smooth surface and a convex compact set (Q6053557) (← links)
