Computing Optimal Experimental Designs via Interior Point Method [PDF]
, 2012 In this paper, we study optimal experimental design problems with a broad class of smooth convex optimality criteria, including the classical A-, D- and p th mean criterion.
Lu, Zhaosong, Pong, Ting Kei
core +2 more sources
A New Hybrid Preconditioner for the Interior Point Method
Trends in Computational and Applied Mathematics, 2019 This study aims to improve the computation of the search direction in the primal-dual Interior Point Method through preconditioned iterative methods. It is about a hybrid approach that combines the Controlled Cholesky Factorization preconditioner and ...
Manolo Rodriguez Heredia +2 more
doaj +1 more source
Convergence analysis of an Inexact Infeasible Interior Point method for Semidefinite Programming [PDF]
, 2004 In this paper we present an extension to SDP of the well known infeasible Interior Point method for linear programming of Kojima,Megiddo and Mizuno (A primal-dual infeasible-interior-point algorithm for Linear Programming, Math. Progr., 1993).
Bellavia, S, Pieraccini, Sandra
core +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
Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections [PDF]
, 2015 This work focuses on the iterative solution of sequences of KKT linear systems arising in interior point methods applied to large convex quadratic programming problems.
Bellavia, S. +3 more
core +2 more sources
Structure-Exploiting Interior Point Methods [PDF]
, 2020 Interior point methods are among the most popular techniques for large scale nonlinear optimization, owing to their intrinsic ability of scaling to arbitrary large problem sizes. Their efficiency has attracted in recent years a lot of attention due to increasing demand for large scale optimization in industry and engineering.
Kardoš, Juraj +2 more
openaire +2 more sources
Optimal Load Shedding in Deregulated System and Consideration of Effective Factors by Using a Predictor-Corrector Interior-Point Method (IPM) [PDF]
Journal of Intelligent Procedures in Electrical Technology, 2010 In this paper, intifially an introduction is presented about Electric Power market in deregulated system and load shedding by interior-point method in these systems. Then, predictor-corrector of IPM is considered and by consideration of the IEEE 6 busbar
Mojtaba Afshari, Saeed Abazari
doaj
On the Construction of Virtual Interior Point Source Travel Time Distances from the Hyperbolic Neumann-to-Dirichlet Map [PDF]
, 2015 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
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
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