A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems [PDF]
Computer Science Journal of Moldova, 2014 In this paper, we first present a brief review about the feasible interior-point algorithm for $P_*(\kappa)$-horizontal linear complementarity problems (HLCPs) based on new directions.
Soodabeh Asadi, Hossein Mansouri
doaj
IEEE Access, 2019 In this work, by considering a variety of realistic hardware impairments, we aim to enhance the security of a cooperative relaying network, where a source intends to transmit its confidential information to a destination in the presence of a group of ...
Majid Moradikia +4 more
doaj +1 more source
On the relationship between bilevel decomposition algorithms and direct interior-point methods [PDF]
, 2004 Engineers have been using bilevel decomposition algorithms to solve certain nonconvex large-scale optimization problems arising in engineering design projects.
Miguel, Angel Víctor de +3 more
core +1 more source
Journal of Numerical Analysis and Approximation TheoryThe focus of this research is to apply primal-dual interior-point pathfollowing methods, specifically those derived from Newton’s method for solving convex quadratic semidefinite optimization (CQSDO) problems. In this paper, we present a numerical study
Yasmina Bendaas, Mohamed Achache
doaj +1 more source
An infeasible interior-point algorithm for monotone linear complementarity problems based on a finite hyperbolic kernel function [PDF]
summary:This paper concerns an infeasible kernel-based interior-point algorithm (IPA) for monotone linear complementarity problems (LCPs). Our algorithm differs from other existing algorithms in the literature since its feasibility step is induced by a ...
Chikouche, Wided +2 more
core +1 more source
Detecting Infeasibility in Infeasible-Interior-Point Methods for Optimization [PDF]
, 2003 Detecting Infeasibility in Infeasible-Interior-Point Methods for ...
Todd, M. J., M. J. Todd
core +4 more sources
Local quadratic convergence of polynomial-time interior-point methods for conic optimization problems [PDF]
In this paper, we establish a local quadratic convergence of polynomial-time interior-point methods for general conic optimization problems. The main structural property used in our analysis is the logarithmic homogeneity of self-concordant barrier ...
NESTEROV, Yu., TUNCEL, Levent
core
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization [PDF]
, 2017 Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability.
Gondzio, Jacek +4 more
core +1 more source
A preconditioned inexact infeasible quantum interior point method for linear optimization
Computational Optimization and ApplicationsAbstract Quantum Interior Point Methods (QIPMs) have been attracting significant interests recently due to their potential of solving optimization problems substantially faster than state-of-the-art conventional algorithms. In general, QIPMs use Quantum Linear System Algorithms (QLSAs) to substitute classical linear system solvers ...
Zeguan Wu, Xiu Yang, Tamás Terlaky
openaire +2 more sources
An Interior-Point algorithm for Nonlinear Minimax Problems [PDF]
We present a primal-dual interior-point method for constrained nonlinear, discrete minimax problems where the objective functions and constraints are not necessarily convex.
E. Obasanjo, G. Tzallas-Regas, B. Rustem
core