Pages that link to "Item:Q3648534"

The following pages link to A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping (Q3648534):

Displayed 38 items.

• Two algorithms for solving single-valued variational inequalities and fixed point problems (Q266349) ‎ (← links)
• Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping (Q286844) ‎ (← links)
• Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping (Q286935) ‎ (← links)
• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) ‎ (← links)
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) ‎ (← links)
• Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization (Q367393) ‎ (← links)
• Multistep hybrid extragradient method for triple hierarchical variational inequalities (Q370154) ‎ (← links)
• Multi-step hybrid viscosity method for systems of variational inequalities defined over sets of solutions of an equilibrium problem and fixed point problems (Q385673) ‎ (← links)
• Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem (Q419918) ‎ (← links)
• Fixed point optimization algorithm and its application to power control in CDMA data networks (Q431032) ‎ (← links)
• Iterative algorithm for solving triple-hierarchical constrained optimization problem (Q535086) ‎ (← links)
• Some iterative methods for solving equilibrium problems and optimization problems (Q623648) ‎ (← links)
• Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping (Q632862) ‎ (← links)
• Decentralized algorithm for centralized variational inequalities in network resource allocation (Q662849) ‎ (← links)
• Iterative methods for triple hierarchical variational inequalities in Hilbert spaces (Q662865) ‎ (← links)
• General iterative algorithm for nonexpansive semigroups and variational inequalities in Hilbert spaces (Q962481) ‎ (← links)
• Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) ‎ (← links)
• A strong convergence theorem for a general split equality problem with applications to optimization and equilibrium problem (Q1616140) ‎ (← links)
• Extragradient-proximal methods for split equilibrium and fixed point problems in Hilbert spaces (Q1680583) ‎ (← links)
• A projected subgradient algorithm for bilevel equilibrium problems and applications (Q1686664) ‎ (← links)
• Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) ‎ (← links)
• A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem (Q1933925) ‎ (← links)
• Extragradient methods and linesearch algorithms for solving Ky Fan inequalities and fixed point problems (Q1935300) ‎ (← links)
• Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces (Q2249816) ‎ (← links)
• Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints (Q2255730) ‎ (← links)
• Split equality monotone variational inclusions and fixed point problem of set-valued operator (Q2399844) ‎ (← links)
• Halpern subgradient extragradient method extended to equilibrium problems (Q2412822) ‎ (← links)
• Fixed point optimization algorithm and its application to network bandwidth allocation (Q2428093) ‎ (← links)
• New iterative scheme with strict pseudo-contractions and multivalued nonexpansive mappings for fixed point problems and variational inequality problems (Q2510630) ‎ (← links)
• Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping (Q2515036) ‎ (← links)
• Optimization for Inconsistent Split Feasibility Problems (Q2805985) ‎ (← links)
• Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (Q2829569) ‎ (← links)
• Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization (Q2977631) ‎ (← links)
• Relaxed hybrid steepest-descent methods with variable parameters for triple-hierarchical variational inequalities (Q3143358) ‎ (← links)
• General algorithm for equilibrium problems and set-valued operators (Q4565158) ‎ (← links)
• Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks (Q4646540) ‎ (← links)
• Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems (Q4979784) ‎ (← links)
• On extragradient-viscosity methods for solving equilibrium and fixed point problems in a Hilbert space (Q4981864) ‎ (← links)