Publication:4581775
From MaRDI portal
zbMath1413.90272MaRDI QIDQ4581775
Publication date: 21 August 2018
Full work available at URL: http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/59
variational inequality; convex function; optimality condition; constrained minimization; gradient-projection algorithm; Lipschitz continuous gradient; Féjér-monotone
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
49M37: Numerical methods based on nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C52: Methods of reduced gradient type
Related Items
STRONG CONVERGENCE OF NEW VISCOSITY RULES OF NONEXPANSIVE MAPPINGS, Unnamed Item, A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space, Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications, Approximating solutions of the generalized modification of the system of equilibrium problems and fixed point problem of a nonexpansive mapping, Inertial self-adaptive parallel extragradient-type method for common solution of variational inequality problems, The generalized viscosity implicit rules of nonexpansive mappings in Hilbert spaces, Iterative approximation of solutions for constrained convex minimization problem, A regularized gradient projection method for the minimization problem, Variant gradient projection methods for the minimization problems, Approximation of solutions to constrained convex minimization problem in Hilbert spaces, Some iterative methods for finding fixed points and for solving constrained convex minimization problems, Averaged mappings and the gradient-projection algorithm, An iterative method for solving minimization, variational inequality and fixed point problems in reflexive Banach spaces, A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions, The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems, Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem, On solving of constrained convex minimize problem using gradient projection method, A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces, Convergence theorem for solving a new concept of the split variational inequality problems and application, A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems, Iterative algorithm of common solutions for a constrained convex minimization problem, a quasi-variational inclusion problem and the fixed point problem of a strictly pseudo-contractive mapping, An iterative algorithm for fixed point problem and convex minimization problem with applications, An intermixed iteration for constrained convex minimization problem and split feasibility problem, A new subgradient extragradient method for solving the split modified system of variational inequality problems and fixed point problem, Iterative methods for constrained convex minimization problem in Hilbert spaces, Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\), A new general system of variational inequalities for convergence theorem and application
