Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation
From MaRDI portal
Publication:4899015
DOI10.1137/110849456zbMATH Open1267.90139OpenAlexW2047873339MaRDI QIDQ4899015FDOQ4899015
Authors: Hideaki Iiduka 
Publication date: 4 January 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110849456
Recommendations
- Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Application of the conditional gradient method to resource allocation in wireless networks
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
fixed point propertiessequential optimization problembandwidth allocation problemaveraging gradient type method
Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonlinear programming (90C30)
Cited In (42)
- Relaxed-inertial derivative-free algorithm for systems of nonlinear pseudo-monotone equations
- A hierarchical variational inequality problem for generalized demimetric mappings with applications
- Dual Variable Inertial Accelerated Algorithm for Split System of Null Point Equality Problems
- Decentralized hierarchical constrained convex optimization
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- New strong convergence theorems for split variational inclusion problems in Hilbert spaces
- Error Estimate of Data Dependence for Discontinuous Operators by New Iteration Process with Convergence Analysis
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Optimization for Inconsistent Split Feasibility Problems
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Steepest-descent Ishikawa iterative methods for a class of variational inequalities in Banach spaces
- Network utility maximization by updating individual transmission rates
- An efficient self-adaptive algorithm for finding common solutions to pseudomonotone variational inequalities and split fixed point problems in Hilbert spaces
- A hybrid method for solving variational inequalities over the common fixed point sets of infinite families of nonexpansive mappings in Banach spaces
- Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints
- Inertial Krasnosel'skiǐ-Mann type hybrid algorithms for solving hierarchical fixed point problems
- Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping
- Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
- Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Iterative methods for solving variational inequality problems with a double-hierarchical structure in Hilbert spaces
- A new accelerated algorithm for solving variational inequalities over the solution of multiple set split common fixed point problem
- Algorithms and Convergence Theorems for Mixed Equilibrium Problems in Hilbert Spaces
- A new explicit iteration method for a class of variational inequalities
- A modified iterative method for a finite collection of non-self mappings and a family of variational inequality problems
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- An extended projected residual algorithm for solving smooth convex optimization problems
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- An inertial S-iteration process
- Variational Inequalities Over the Intersection of Fixed Point Sets of Generalized Demimetric Mappings and Zero Point Sets of Maximal Monotone Mappings
- Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning
- New algorithms for a class of accretive variational inequalities in Banach spaces
- Fixed point optimization algorithm and its application to network bandwidth allocation
- A steepest-descent Krasnosel'skii-Mann algorithm for a class of variational inequalities in Banach spaces
- Variational inequality over the set of common solutions of a system of bilevel variational inequality problem with applications
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- A method with inertial extrapolation step for convex constrained monotone equations
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
- An iterative method and its application to stable inversion
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Two new algorithms to solve the system of generalized mixed equilibrium and fixed point problems in Banach spaces
This page was built for publication: Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899015)
