Properties of the Quadratic Transformation of Dual Variables
We investigate a solution of a convex programming problem with a strongly convex objective function based on the dual approach. A dual optimization problem has constraints on the positivity of variables. We study the methods and properties of transformations of dual variables that enable us to obtai...
Main Authors: | Vladimir Krutikov, Elena Tovbis, Anatoly Bykov, Predrag Stanimirovic, Ekaterina Chernova, Lev Kazakovtsev |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/16/3/148 |
Similar Items
-
A Family of Multi-Step Subgradient Minimization Methods
by: Elena Tovbis, et al.
Published: (2023-05-01) -
RESEARCH OF ONE VARIANT OF SUBGRADIENT METHOD
by: N. S. Samoylenko, et al.
Published: (2015-06-01) -
Special type convex functions on Riemannian manifolds with application
by: Ehtesham Akhter, et al.
Published: (2023-04-01) -
A Fixed-Point Subgradient Splitting Method for Solving Constrained Convex Optimization Problems
by: Nimit Nimana
Published: (2020-03-01) -
Relaxation Subgradient Algorithms with Machine Learning Procedures
by: Vladimir Krutikov, et al.
Published: (2022-10-01)