Fixed point optimization algorithm and its application to power control in CDMA data networks
DOI10.1007/s10107-010-0427-xzbMath1274.90428OpenAlexW1996731061MaRDI QIDQ431032
Publication date: 26 June 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0427-x
fixed pointutility functionvariational inequality problemfirmly nonexpansive mappingpower controlfixed point optimization algorithmtwo-stage non-convex optimization problem
Noncooperative games (91A10) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Other game-theoretic models (91A40)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- An ergodic algorithm for the power-control games for CDMA data networks
- Iterative selection methods for common fixed point problems
- Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- Convex analysis and nonlinear optimization. Theory and examples
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Non-cooperative games
- A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
- Some problems and results in fixed point theory
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Finding the nearest point in A polytope
- A New Projection Method for Variational Inequality Problems
- Power control and rate management for wireless multimedia CDMA systems
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Linear multiuser receivers: effective interference, effective bandwidth and user capacity
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Krasnoselski–Mann iteration for hierarchical fixed-point problems
- Equilibrium points in n -person games