Results 11 to 20 of about 112,928 (251)
Our aim in this work is to extend the primal-dual interior point method based on a kernel function for linear fractional problem. We apply the techniques of kernel function-based interior point methods to solve a standard linear fractional program.
Mousaab Bouafia, Adnan Yassine
doaj +1 more source
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
A new search direction for full-Newton step infeasible interior-point method in linear optimization
In this work, we investigate a full Newton step infeasible interior-point method for linear optimization based on a new search direction which is obtained from an algebraic equivalent transformation of the central path system.
Behrouz Kheirfam
doaj +1 more source
Structure-Exploiting Interior Point Methods [PDF]
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
Radio frequency interference suppression filters design for HF radar based on SOCP
High-frequency radar is easily affected by radio frequency interference (RFI) since it shares the band with many radio services. To mitigate the RFIs, this study designs receiver for radar's fast-time processing.
Zhaoyi Wang +4 more
doaj +1 more source
Interior point methods in the year 2025
Interior point methods (IPMs) have hugely influenced the field of optimization. Their fast development has been triggered by the seminal paper of Narendra Karmarkar published in 1984 which delivered a polynomial algorithm for linear programming and ...
Jacek Gondzio
doaj +1 more source
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs [PDF]
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and ...
Ali Nakhaei Amroudi +2 more
doaj +1 more source
Optimal Correction of Infeasible Systems in the Second Order Conic Linear Setting [PDF]
In this paper we consider correcting infeasibility in a second order conic linear inequality by minimal changes in the problem data. Under certain conditions, it is proved that the minimal correction can be done by solving a lower dimensional convex ...
Maziar Salahi
doaj
Sparse Approximations with Interior Point Methods
Large-scale optimization problems that seek sparse solutions have become ubiquitous. They are routinely solved with various specialized first-order methods. Although such methods are often fast, they usually struggle with not-so-well conditioned problems.
Valentina De Simone +4 more
openaire +5 more sources
An infeasible interior point methods for convex quadratic problems
In this paper, we deal with the study and implementation of an infeasible interior point method for convex quadratic problems (CQP). The algorithm uses a Newton step and suitable proximity measure for approximately tracing the central path and ...
Hayet Roumili, Nawel Boudjellal
doaj +2 more sources

