Results 201 to 210 of about 116,336 (250)

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.
Nikolaos Ploskas, Nikolaos Samaras
  +5 more sources

Insights into the interior-point methods

ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1992
This paper studies the search directions of three important interior- point algorithms, namely, the primal-affine scaling method, the dual- affine scaling method and the primal-dual interior point method (with logarithmic barrier function). From an algebraic point of view, the paper shows that the search directions of these three algorithms are merely ...
Ruey-Lin Sheu, Shu-Cherng Fang
openaire   +1 more source

Interior point methods for placement

1994 IEEE International Symposium on Circuits and Systems (ISCAS), 1994
In VLSI layout optimization, the placement problem is usually solved with simulated annealing or heuristic algorithms. These procedures often begin with random initial configurations but may benefit greatly (in terms of execution time or quality of solution) when good initial relative placements are provided.
P. Chin, Anthony Vannelli
openaire   +1 more source

On the Complexity of a Practical Interior-Point Method

SIAM Journal on Optimization, 1998
Summary: The theory of self-concordance in convex optimization has been used to analyze the complexity of interior-point methods based on Newton's method. For large problems, it may be impractical to use Newton's method; here we analyze a truncated-Newton method, in which an approximation to the Newton search direction is used.
Stephen G. Nash, Ariela Sofer
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