Results 11 to 20 of about 101,513 (251)

Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems

open access: yesCroatian Operational Research Review, 2016
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps.
Goran Lešaja, Mustafa Ozen
doaj   +1 more source

A New Hybrid Preconditioner for the Interior Point Method

open access: yesTrends 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

The Symbolic Interior Point Method

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2017
Numerical optimization is arguably the most prominent computational framework in machine learning and AI. It can be seen as an assembly language for hard combinatorial problems ranging from classification and regression in learning, to computing optimal policies and equilibria in decision theory, to entropy minimization in information ...
Mladenov, Martin   +2 more
openaire   +3 more sources

Komputasi Aliran Daya Optimal Sistem Tenaga Skala Besar dengan Metode Primal Dual Interior Point

open access: yesJurnal Rekayasa Elektrika, 2016
This paper focuses on the use of Primal Dual Interior Point method in the analysis of optimal power flow. Optimal power flow analysis with Primal Dual Interior Point method then compared with Linear Programming Method using Matpower program.
Syafii Syafii, Ikhwannul Kadri Masrul
doaj   +1 more source

A new non-monotonic infeasible simplex-type algorithm for Linear Programming [PDF]

open access: yesPeerJ 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

Optimal Load Shedding in Deregulated System and Consideration of Effective Factors by Using a Predictor-Corrector Interior-Point Method (IPM) [PDF]

open access: yesJournal 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  

Matrix Structure Driven Interior Point Method for Quadrotor Real-Time Trajectory Planning

open access: yesIEEE 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 predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique [PDF]

open access: yesYugoslav Journal of Operations Research, 2014
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

On Implementing a Two-Step Interior Point Method for Solving Linear Programs

open access: yesAlgorithms
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

open access: yesJournal 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

Home - About - Disclaimer - Privacy