On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method

International Journal of Mathematics and Mathematical Sciences - United States
doi 10.1155/2018/1580837
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Hindawi Limited

Related search

Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems With Generalized Mixed Equilibrium Problems

Journal of Function Spaces and Applications
2012English

Regularized Gradient-Projection Methods for Equilibrium and Constrained Convex Minimization Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2013English

Regularized Gradient-Projection Methods for the Constrained Convex Minimization Problem and the Zero Points of Maximal Monotone Operator

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2015English

The Combination Projection Method for Solving Convex Feasibility Problems

Mathematics
Mathematics
2018English

On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

Semismooth Newton Method for Gradient Constrained Minimization Problem

2012English

Technical Note—Solving Constrained Multi-Facility Location Problems InvolvinglpDistances Using Convex Programming

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1975English

On Long-Step Surrogate Projection Methods for Solving Convex Feasibility Problems

1996English

Iterative Algorithms Based on the Viscosity Approximation Method for Equilibrium and Constrained Convex Minimization Problem

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy