A new search direction of IPM for horizontal linear complementarity problems
This study presents a new search direction for the horizontal linear complementarity problem. A vector-valued function is applied to the system of xy=μe, which defines the central path.
Xiaoyu Gong +4 more
doaj +1 more source
On the Construction of Virtual Interior Point Source Travel Time Distances from the Hyperbolic Neumann-to-Dirichlet Map [PDF]
We introduce a new algorithm to construct travel time distances between a point in the interior of a Riemannian manifold and points on the boundary of the manifold, and describe a numerical implementation of the algorithm.
de Hoop, Maarten +2 more
core +2 more sources
An interior-point method for mpecs based on strictly feasible relaxations. [PDF]
An interior-point method for solving mathematical programs with equilibrium constraints (MPECs) is proposed. At each iteration of the algorithm, a single primaldual step is computed from each subproblem of a sequence.
Angel Víctor De Miguel +4 more
core +4 more sources
On the relationship of interior-point methods
In this paper, we show that the moving directions of the primal-affine scaling method (with logarithmic barrier function), the dual-affine scaling method (with logarithmic barrier function), and the primal-dual interior point method are merely the Newton
Ruey-Lin Sheu, Shu-Cherng Fang
doaj +1 more source
Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming [PDF]
In this paper we will discuss two variants of an inexact feasible interior point algorithm for convex quadratic programming. We will consider two different neighbourhoods: a (small) one induced by the use of the Euclidean norm which yields a short-step ...
Andersen E. D., Jacek Gondzio
core +2 more sources
On the Stationary Cahn-Hilliard Equation: Bubble Solutions [PDF]
We study stationary solutions of the Cahn--Hilliard equation in a bounded smooth domain which have an interior spherical interface (bubbles). We show that a large class of interior points (the ``nondegenerate peak'' points) have the following ...
Wei, J, Winter, M
core +1 more source
On Implementing a Two-Step Interior Point Method for Solving Linear Programs
A new two-step interior point method for solving linear programs is presented. The technique uses a convex combination of the auxiliary and central points to compute the search direction.
Sajad Fathi Hafshejani +2 more
doaj +1 more source
Homotopy Interior-Point Method for a General Multiobjective Programming Problem
We present a combined homotopy interior-point method for a general multiobjective programming problem. For solving the KKT points of the multiobjective programming problem, the homotopy equation is constructed. We prove the existence and convergence of a
X. Zhao, S. G. Zhang, Q. H. Liu
doaj +1 more source
A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique [PDF]
In this paper, we present a predictor-corrector path-following interior-point algorithm for symmetric cone optimization based on Darvay's technique.
Kheirfam Behrouz
doaj +1 more source
Distributed Interior-point Method for Loosely Coupled Problems
In this paper, we put forth distributed algorithms for solving loosely coupled unconstrained and constrained optimization problems. Such problems are usually solved using algorithms that are based on a combination of decomposition and first order methods.
Andersen, Martin S. +2 more
core +1 more source

