Results 221 to 230 of about 1,515,221 (275)

Interior-Point Methods

2017
One of the most powerful methods for solving nonlinear optimization problems known as interior point methods is to be presented in this chapter. They are related to barrier functions. The terms “interior point methods” and “barrier methods” have the same significance and may be used interchangeably.
Richard W. Cottle, Mukund N. Thapa
  +5 more sources

Interior-Point Methods

2008
Linear programs can be viewed in two somewhat complementary ways. They are, in one view, a class of continuous optimization problems each with continuous variables defined on a convex feasible region and with a continuous objective function. They are, therefore, a special case of the general form of problem considered in this text.
David G. Luenberger, Yinyu Ye
openaire   +2 more sources

Inexact Interior-Point Method

Journal of Optimization Theory and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Interior-Point Methods

2013
The ellipsoid method has an undeniable historical relevance (due to its role in establishing polynomial time for linear programming with integer data). In addition, its underlying idea is simple and elegant. Unfortunately, it is not efficient in practice compared with both the simplex method and the more recent interior-point methods.
Peter Bürgisser, Felipe Cucker
openaire   +2 more sources

Interior Point Methods

1996
It was mentioned earlier that the standard simplex method searches for an optimum to a linear program by moving along the surface of a convex polyhedron from one extreme point to an adjacent extreme point in a fashion such that the objective value is nondecreasing between successive basic feasible solutions.
Cornelis Roos, Jean-Philippe Vial
openaire   +2 more sources

Home - About - Disclaimer - Privacy