The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

doi:10.1016/0041-5553(67)90040-7

USSR Computational Mathematics and Mathematical Physics

Volume 7, Issue 3, 1967, Pages 200-217

USSR Computational M...

https://doi.org/10.1016/0041-5553(67)90040-7 Get rights and content

Abstract

IN this paper we consider an iterative method of finding the common point of convex sets. This method can be regarded as a generalization of the methods discussed in [1–4]. Apart from problems which can be reduced to finding some point of the intersection of convex sets, the method considered can be applied to the approximate solution of problems in linear and convex programming.

References (8)

S. Agmon
The relaxation method for linear inequalities
Can. J. Math.
(1954)
T.S. Motzkin et al.
The relaxation method for linear inequalities
Can. J. Math.
(1954)
I.I. Eremin
A generalization of the Motzkin — Agmon relaxational method
Usp. mat. Nauk
(1965)
L.M. Bregman
Finding the common point of convex sets by the method of successive projections
Dokl. Akad. Nauk SSSR
(1965)

There are more references available in the full text version of this article.

Cited by (2330)

Gossip-based distributed stochastic mirror descent for constrained optimization
2024, Neural Networks
This paper considers a distributed constrained optimization problem over a multi-agent network in the non-Euclidean sense. The gossip protocol is adopted to relieve the communication burden, which also adapts to the constantly changing topology of the network. Based on this idea, a gossip-based distributed stochastic mirror descent (GB-DSMD) algorithm is proposed to handle the problem under consideration. The performances of GB-DSMD algorithms with constant and diminishing step sizes are analyzed, respectively. When the step size is constant, the error bound between the optimal function value and the expected function value corresponding to the average iteration output of the algorithm is derived. While for the case of the diminishing step size, it is proved that the output of the algorithm uniformly approaches to the optimal value with probability 1. Finally, as a numerical example, the distributed logistic regression is reported to demonstrate the effectiveness of the GB-DSMD algorithm.
A multidimensional objective prior distribution from a scoring rule
2024, Journal of Statistical Planning and Inference
The construction of objective priors is, at best, challenging for multidimensional parameter spaces. A common practice is to assume independence and set up the joint prior as the product of marginal distributions obtained via “standard” objective methods, such as Jeffreys or reference priors. However, the assumption of independence a priori is not always reasonable, and whether it can be viewed as strictly objective is still open to discussion. In this paper, by extending a previously proposed objective approach based on scoring rules for the one dimensional case, we propose a novel objective prior for multidimensional parameter spaces which yields a dependence structure. The proposed prior has the appealing property of being proper and does not depend on the chosen model; only on the parameter space considered.
One-step Bayesian example-dependent cost classification: The OsC-MLP method
2024, Neural Networks
Example-dependent cost classification problems are those where the decision costs depend not only on the true and the attributed classes but also on the sample features. Discriminative algorithms that carry out such classification tasks must take this dependence into account. In some applications, the decision costs are known for the training set but not in production, which complicates the problem.
In this paper, we introduce a new one-step Bayesian formulation to train Neural Networks and solve the above limitation for binary cases with one-step Learning Machines, avoiding the drawbacks that unknown analytical forms of the example-dependent costs create. The formulation is based on defining an artificial likelihood ratio by using the available training classification costs in its definition, and proposes a test that does not require the values of the costs for unseen samples. Furthermore, it also includes Bayesian rebalancing mechanisms to combat the negative effects of class imbalance. Experimental results support the consistency and effectiveness of the corresponding algorithms.
Discounted dynamic optimization and Bregman divergence
2024, Journal of Mathematical Economics
A BREGMAN PROJECTION ALGORITHM WITH SELF ADAPTIVE STEP SIZES FOR SPLIT VARIATIONAL INEQUALITY PROBLEMS INVOLVING NON-LIPSCHITZ OPERATORS
2024, Journal of Nonlinear and Variational Analysis
Novel inertial methods for fixed point problems in reflexive Banach spaces with applications
2024, Rendiconti del Circolo Matematico di Palermo

View all citing articles on Scopus

^☆: Zh. vȳchisl. Mat. mat. Fiz. 7, 3, 620–631, 1967.

View full text

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming☆

Abstract

The relaxation method for linear inequalities

Can. J. Math.

The relaxation method for linear inequalities

Can. J. Math.

A generalization of the Motzkin — Agmon relaxational method

Usp. mat. Nauk

Finding the common point of convex sets by the method of successive projections

Dokl. Akad. Nauk SSSR