Results 241 to 250 of about 968,452 (278)
Some of the next articles are maybe not open access.

Interior Point Methods for LP

2009
In a linear program, typically there are inequality constraints, and equality constraints, on the variables. In LP literature, a feasible solution is known as a:
openaire   +1 more source

Interior Point Algorithms: Barrier Methods

1999
In Chapter 7 the solution philosophy was based on an affine or projective transformation so that at the start of each iteration we were at the “center” of the polytope instead of on the boundary. This allowed a large step in the direction of a projected gradient.
openaire   +1 more source

Polynomial-Time Interior-Point Methods

2018
In this section, we present the problem classes and complexity bounds of polynomial-time interior-point methods. These methods are based on the notion of a self-concordant function. It appears that such a function can be easily minimized by the Newton’s Method.
openaire   +1 more source

Interior-point methods

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

Interior Point Methods in Decomposition

1997
Interior point techniques have not only shown their applicability in barrier methods for linear and nonlinear optimization, but also in cutting plane methods. Pioneers in this area are Goffin and Vial and co-workers (e.g., [74, 75, 77]). We briefly outline their approach.
openaire   +1 more source

Interior Methods for Nonlinear Optimization

SIAM Review, 2002
Anders Forsgren, Philip E Gill
exaly  

An Inexact Interior Point method

1998
In this paper, we introduce an inexact interior-point algorithm for a constrained system of equations. The formulation of the problem is quite general and includes nonlinear complementarity problems of various kinds. In our convergence theory, we interpret the inexact interior-point method as an inexact Newton method.
openaire   +1 more source

Home - About - Disclaimer - Privacy