Decentralized hierarchical constrained convex optimization
DOI10.1007/s11081-019-09440-7zbMath1431.65086OpenAlexW2947044637WikidataQ127758003 ScholiaQ127758003MaRDI QIDQ2303528
Publication date: 4 March 2020
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-019-09440-7
optimal controlfixed pointnonexpansive mappingdecentralized optimizationparamonotonenetwork resource allocationhierarchical constrained convex optimizationincremental optimization algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Pegasos: primal estimated sub-gradient solver for SVM
- Incremental proximal methods for large scale convex optimization
- Iterative approximation of fixed points
- The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
- Approximation of fixed points of nonexpansive mappings
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- The mathematics of internet congestion control
- Ill-posed problems with a priori information
- Alternating convex projection methods for discrete-time covariance control design
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Construction of fixed points of nonlinear mappings in Hilbert space
- Hard-constrained inconsistent signal feasibility problems
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Stochastic Linear Quadratic Regulators with Indefinite Control Weight Costs
- Linear matrix inequalities, Riccati equations, and indefinite stochastic linear quadratic controls
- An Introduction to Variational Inequalities and Their Applications
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Viscosity Solutions of Minimization Problems
- Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
- Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Fixed points of nonexpanding maps
- On a Matrix Riccati Equation of Stochastic Control
- Convex Analysis
- A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs
- Krasnoselski–Mann iteration for hierarchical fixed-point problems
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Decentralized hierarchical constrained convex optimization