Results 221 to 230 of about 10,446 (263)

Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming

Journal of the Operational Research Society, 1994
Summary: This paper presents a modification of one variant of Karmarkar's interior-point linear programming algorithm to Multiobjective Linear Programming (MOLP) problems. We show that by taking the variant known as the affine-scaling primal algorithm, generating locally-relevant scaling coefficients and applying them to the projected gradients ...
openaire   +1 more source

Evaluating the form errors of spheres, cylinders and cones using the primal–dual interior point method

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2013
In precision metrology, the form errors between the measured data and reference nominal surfaces are usually evaluated in four approaches: least squares elements, minimum zone elements, maximum inscribed elements and minimum circumscribed elements. The calculation of minimum zone element, maximum inscribed element and minimum circumscribed element is ...
X. Zhang, X. Jiang, A. B. Forbes, H. D. Minh, P. J. Scott   +4 more
openaire   +1 more source

Using the Cone Calorimeter to Predict FMVSS 302 Performance of Interior and Exterior Automotive Materials

SAE Technical Paper Series, 2006
<div class="htmlview paragraph">Forty-eight materials from parts used inside and outside the passenger compartment of six motor vehicles were tested according to FMVSS 302. All samples passed the test although the FMVSS 302 test requirements do not apply to exterior materials.
K. Carpenter, M. Janssens, A. Sauceda
openaire   +1 more source

A class of polynomial interior-point algorithms for the Cartesian second-order cone linear complementarity problem

Nonlinear Analysis: Theory, Methods & Applications, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, G. Q., Zhu, D. T.
openaire   +1 more source

Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone

Optimization, 2013
We define weakly minimal elements of a set with respect to a convex cone by means of the quasi-interior of the cone and characterize them via linear scalarization, generalizing the classical weakly minimal elements from the literature. Then we attach to a general vector optimization problem, a dual vector optimization problem with respect to ...
Sorin-Mihai Grad, Emilia-Loredana Pop
openaire   +1 more source

A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones

Journal of Optimization Theory and Applications, 2011
The aim of the authors is to extend the interior point algorithms for linear optimization and sufficient linear complementarity problems based on the kernel functions to the Cartesian P-matrix linear complementarity problem over symmetric cones. The difficulty of the extension is that a symmetric cone is nonpolyhedral.
Wang, G. Q., Bai, Y. Q.
openaire   +2 more sources

Comparison of cone and OSU calorimetric techniques to assess the flammability behaviour of fabrics used for aircraft interiors

Fire and Materials, 2005
AbstractTwo test methods for measuring the heat release rate, HRR have been compared on fabric composites used for aircraft interior materials as side‐wall panels. These methods are based on the principles of direct measurement of the convective and radiant heat by thermopiles using an Ohio State University (OSU) calorimeter, and oxygen consumption ...
B. K. Kandola, A. R. Horrocks, K. Padmore, Joyce Dalton, Tim Owen   +4 more
openaire   +1 more source

Extension of primal-dual interior point methods to diff-convex problems on symmetric cones

Optimization, 2013
We consider the extension of primal dual interior point methods for linear programming on symmetric cones, to a wider class of problems that includes approximate necessary optimality conditions for functions expressible as the difference of two convex functions of a special form. Our analysis applies the Jordan-algebraic approach to symmetric cones. As
openaire   +1 more source

Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming

Mathematical Methods of Operations Research, 2010
The authors propose a second order interior point algorithm for symmetric cone programming, using a wide neighborhood of the central path. The basic tool of their analysis of the complexity bounds of the proposed methods is the theory of Euclidean Jordan algebras. Polynomial convergence for several infeasible and feasible interior point methods is also
Zhang, Jian, Zhang, Kecun
openaire   +1 more source

Primal-Dual Interior-Point Methods for Second-Order Cone Complementarity Based on a New Class of Kernel Function

2010 Third International Joint Conference on Computational Science and Optimization, 2010
In this paper we study primal-dual interior point methods (IPMs) based on a new class of kernel functions which were designed by M. El Ghami, J.B.M Melissen and C. Roos for linear optimization, we extend the functions to second-order cone complementarity(SOCCP).
Xue-mei Yang, Hua-li Zhao, Guo-ling Hu
openaire   +1 more source