The following pages link to Hideaki Iiduka (Q286843):
Displaying 45 items.
- 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)
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← 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)
- 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)
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization (Q737229) (← links)
- An ergodic algorithm for the power-control games for CDMA data networks (Q841608) (← links)
- Weak convergence of an iterative sequence for accretive operators in Banach spaces (Q884246) (← links)
- Strong convergence studied by a hybrid type method for monotone operators in a Banach space (Q927936) (← links)
- (Q1016415) (redirect page) (← links)
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
- Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings (Q1776942) (← links)
- Hybrid Riemannian conjugate gradient methods with global convergence properties (Q2023690) (← links)
- Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning (Q2045021) (← links)
- Sufficient descent Riemannian conjugate gradient methods (Q2046556) (← links)
- Global convergence of Hager-Zhang type Riemannian conjugate gradient method (Q2101972) (← links)
- Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints (Q2138441) (← links)
- Riemannian stochastic fixed point optimization algorithm (Q2159421) (← links)
- Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints (Q2255730) (← links)
- Fixed point quasiconvex subgradient method (Q2282530) (← links)
- Decentralized hierarchical constrained convex optimization (Q2303528) (← links)
- Fixed point optimization algorithm and its application to network bandwidth allocation (Q2428093) (← links)
- Weak convergence of a projection algorithm for variational inequalities in a Banach space (Q2465177) (← links)
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping (Q2515036) (← links)
- A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping (Q2786330) (← links)
- PARALLEL OPTIMIZATION ALGORITHM FOR SMOOTH CONVEX OPTIMIZATION OVER FIXED POINT SETS OF QUASI-NONEXPANSIVE MAPPINGS (Q2799656) (← links)
- Optimization for Inconsistent Split Feasibility Problems (Q2805985) (← links)
- (Q2812271) (← links)
- (Q2812278) (← links)
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (Q2829569) (← links)
- (Q2936128) (← links)
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization (Q2977631) (← links)
- (Q3116777) (← links)
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation (Q3143255) (← links)
- (Q3378839) (← links)
- (Q3434747) (← links)
- Iterative methods for parallel convex optimization with fixed point constraints (Q5244136) (← links)
- Theoretical analysis of Adam using hyperparameters close to one without Lipschitz smoothness (Q6145578) (← links)
- Incremental and Parallel Machine Learning Algorithms with Automated Learning Rate Adjustments (Q6273466) (← links)
