Results 21 to 30 of about 971,996 (282)
Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming [PDF]
, 2012 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 relationship of interior-point methods
International Journal of Mathematics and Mathematical Sciences, 1993 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
Distributed Interior-point Method for Loosely Coupled Problems
, 2013 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
On the Stationary Cahn-Hilliard Equation: Bubble Solutions [PDF]
, 1998 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
AlgorithmsA 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
Journal of Applied Mathematics, 2012 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
Matrix Structure Driven Interior Point Method for Quadrotor Real-Time Trajectory Planning
IEEE Access, 2019 Sequential convex programming (SCP) has been recently employed in various trajectory planning problems, including entry flight, planetary landing, and aircraft formation.
Guangtong Xu +3 more
doaj +1 more source
A new non-monotonic infeasible simplex-type algorithm for Linear Programming [PDF]
PeerJ Computer Science, 2020 This paper presents a new simplex-type algorithm for Linear Programming with the following two main characteristics: (i) the algorithm computes basic solutions which are neither primal or dual feasible, nor monotonically improving and (ii) the sequence ...
Charalampos P. Triantafyllidis +1 more
doaj +2 more sources
A Warm-start Interior-point Method for Predictive Control [PDF]
, 2010 In predictive control, a quadratic program (QP) needs to be solved at each sampling instant. We present a new warm-start strategy to solve a QP with an interior-point method whose data is slightly perturbed from the previous QP.
Constantinides, GA +2 more
core +2 more sources
A new search direction of IPM for horizontal linear complementarity problems
Frontiers in Energy Research, 2023 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