Results 221 to 230 of about 101,532 (252)
Some of the next articles are maybe not open access.
2013
As was known, the simplex method moves on the underlying polyhedron, from vertex to adjacent vertex along descent edges, until an optimal vertex is reached, or unboundedness of the problem is detected. Nevertheless, it would go through an exponential number of vertices of the polyhedron (Sect. 3.8), and even stall at a vertex forever because of cycling
openaire +1 more source
As was known, the simplex method moves on the underlying polyhedron, from vertex to adjacent vertex along descent edges, until an optimal vertex is reached, or unboundedness of the problem is detected. Nevertheless, it would go through an exponential number of vertices of the polyhedron (Sect. 3.8), and even stall at a vertex forever because of cycling
openaire +1 more source
On Numerical Issues of Interior Point Methods
SIAM Journal on Matrix Analysis and Applications, 2008This paper concerns some numerical stability issues of factorizations in interior point methods. In our investigation we focus on regularization techniques for the augmented system. We derive the fundamental property of regularization and necessary conditions for the convergence of iterative refinement. A relaxation technique is described that improves
openaire +1 more source
Interior point methods for equilibrium problems
Computational Optimization and Applications, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An interior point method for nonlinear programming
Zeitschrift für Operations Research, 1979In this paper an interior point method is presented for nonlinear programming problems with inequality constraints. On defining a modified distance function the original problem is solved sequentially by using a method of feasible directions. At each iteration a usable feasible direction can be determined explicitly. Under certain assumptions it can be
openaire +2 more sources
1995
In this chapter we will describe the methods that start with a point in the interior of the feasible region and continue through the interior towards the boundary solution. The study of these methods was started by the work of Karmarkar, and has been an area of intense international activity during the past decade.
openaire +1 more source
In this chapter we will describe the methods that start with a point in the interior of the feasible region and continue through the interior towards the boundary solution. The study of these methods was started by the work of Karmarkar, and has been an area of intense international activity during the past decade.
openaire +1 more source
A Gravitational Interior Point Method for LP
OPSEARCH, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An ADMM-based interior-point method for large-scale linear programming
Optimization Methods and Software, 2021Shuzhong Zhang, Tianyi Lin, Yinyu Ye
exaly
In this paper we discuss the main concepts of structural optimization, a field of nonlinear programming, which was formed by the intensive development of modern interior-point schemes..
openaire +1 more source
openaire +1 more source
A Quantum Interior Point Method for LPs and SDPs
ACM Transactions on Quantum Computing, 2020Anupam Prakash, Iordanis Kerenidis
exaly