Skip to search formSkip to main contentSkip to account menu

Mathematical Optimization Society

Known as: Mathematical Programming Society, Mathematical Programming (journal), MOS 
The Mathematical Optimization Society (MOS), known as the Mathematical Programming Society until 2010, is an international association of researchers… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems… 
Highly Cited
1998
Highly Cited
1998
In this paper we consider stochastic programming problems where the objective function is given as an expected value function. We… 
Highly Cited
1998
Highly Cited
1998
This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed… 
Highly Cited
1998
Highly Cited
1998
We present an algorithm for the variational inequality problem on convex sets with nonempty interior. The use of Bregman… 
Highly Cited
1998
Highly Cited
1998
AbstractWe describe an approximation algorithm for the independence number of a graph. If a graph onn vertices has an… 
Highly Cited
1997
Highly Cited
1997
Primal-dual pairs of semidefinite programs provide a general framework for the theory and algorithms for the trust region… 
1997
1997
This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haeberly-Overton direction for… 
Highly Cited
1997
Highly Cited
1997
We compute constrained equilibria satisfying an optimality condition. Important examples include convex programming, saddle… 
Highly Cited
1997
Highly Cited
1997
Necessary and sufficient conditions for the set of solutions of a pseudomonotone variational inequality problem to be nonempty… 
Review
1982
Review
1982
To resolve the often conflicting and confusing results of computational testing of mathematical software reported in the…