A hybrid descent method for solving a convex constrained optimization problem with applications

DOI10.1002/mma.5855zbMath1433.49015OpenAlexW2971514741MaRDI QIDQ5214959

Xiaolong Qin, Liya Liu, Jen-Chih Yao

Publication date: 5 February 2020

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.5855

zbMATH Keywords

variational inequalitiesquasi-nonexpansive mappingstrongly pseudo-monotone mappingbandwidth allocation problemhybrid descent methods

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Existence theories for optimal control problems involving partial differential equations (49J20)

Related Items (2)

Hierarchical variational inequality problem and split common fixed point of averaged operators ⋮ Variational inequality over the set of common solutions of a system of bilevel variational inequality problem with applications

This page was built for publication: A hybrid descent method for solving a convex constrained optimization problem with applications