Decentralized hierarchical constrained convex optimization (Q2303528): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 01:48, 29 July 2024

scientific article

Language	Label	Description	Also known as
English	Decentralized hierarchical constrained convex optimization	scientific article

Statements

scholarly article

0 references

Decentralized hierarchical constrained convex optimization (English)

0 references

0 references

Optimization and Engineering

0 references

publication date

4 March 2020

0 references

zbMATH Keywords

decentralized optimization

0 references

fixed point

0 references

hierarchical constrained convex optimization

0 references

incremental optimization algorithm

0 references

network resource allocation

0 references

nonexpansive mapping

0 references

optimal control

0 references

paramonotone

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11081-019-09440-7

0 references

Viscosity Solutions of Minimization Problems

0 references

Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Iterative approximation of fixed points

0 references

Incremental proximal methods for large scale convex optimization

0 references

0 references

Construction of fixed points of nonlinear mappings in Hilbert space

0 references

Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization

0 references

An interior point method with Bregman functions for the variational inequality problem with paramonotone operators

0 references

Stochastic Linear Quadratic Regulators with Indefinite Control Weight Costs

0 references

A block-iterative surrogate constraint splitting method for quadratic signal recovery

0 references

Hard-constrained inconsistent signal feasibility problems

0 references

Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm

0 references

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

0 references

Alternating convex projection methods for discrete-time covariance control design

0 references

Fixed points of nonexpanding maps

0 references

Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods

0 references

Iterative algorithm for solving triple-hierarchical constrained optimization problem

0 references

Fixed point optimization algorithm and its application to power control in CDMA data networks

0 references

Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation

0 references

Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems

0 references

Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping

0 references

Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings

0 references

Proximal point algorithms for nonsmooth convex optimization with fixed point constraints

0 references

Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions

0 references

Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms

0 references

A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping

0 references

Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation

0 references

An Introduction to Variational Inequalities and Their Applications

0 references

0 references

The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces

0 references

0 references

Mean Value Methods in Iteration

0 references

Krasnoselski–Mann iteration for hierarchical fixed-point problems

0 references

Incremental Subgradient Methods for Nondifferentiable Optimization

0 references

Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods

0 references

Linear matrix inequalities, Riccati equations, and indefinite stochastic linear quadratic controls

0 references

Convex Analysis

0 references

Pegasos: primal estimated sub-gradient solver for SVM

0 references

Robust Wideband Beamforming by the Hybrid Steepest Descent Method

0 references

The mathematics of internet congestion control

0 references

0 references

Ill-posed problems with a priori information

0 references

Approximation of fixed points of nonexpansive mappings

0 references

On a Matrix Riccati Equation of Stochastic Control

0 references

0 references

Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization

0 references

A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s11081-019-09440-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2303528

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2303528&oldid=36806253"