Results 221 to 230 of about 15,567,526 (268)

Designing for aging on the move: a user-needs-driven approach to an optimized recreational vehicle (RV) scheme for older Chinese using an integrated Kano-AHP-QFD framework. [PDF]

Front Public Health
Jing Y, Yu S, Cheng Y, Yang X.
europepmc   +1 more source

Implementation of a Cancer Navigation Intervention for Newly Diagnosed Survivors of Breast Cancer: Protocol for a Randomized Controlled Trial. [PDF]

JMIR Res Protoc
D'Souza MS, Gidda R, Smith M, Swaminadhan A, Strank AJ, Nairy A.   +5 more
europepmc   +1 more source

Development of arthroscopy: contributions of Masaki Watanabe and Japan. [PDF]

Int Orthop
Taketomi S, Tanaka S.
europepmc   +1 more source

Degeneracy in interior point methods for linear programming: A survey. [PDF]

Roos, C., Tsuchiya, T., Hertog, D. den, Güler, O., Terlaky, T.   +4 more
core  

Some of the next articles are maybe not open access.

Related searches:

The interior-point method for linear programming

IEEE Software, 1992
A robust, reliable, and efficient implementation of the primal-dual interior-point method for linear programs, which is based on three well-established optimization algorithms, is presented. The authors discuss the theoretical foundation for interior-point methods which consists of three crucial building blocks: Newton's method for solving nonlinear ...
Greg Astfalk, Irvin Lustig, Roy E. Marsten, David F. Shanno   +3 more
exaly   +2 more sources

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   +2 more sources

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   +2 more sources