A primal-dual interior-point method based on a new kernel function for linear complementarity problem
From MaRDI portal
Publication:5243687
DOI10.1142/S1793557120500011zbMath1425.90114OpenAlexW2884929662MaRDI QIDQ5243687
El Amir Djeffal, Mounia Laouar
Publication date: 19 November 2019
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557120500011
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Cites Work
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Feasibility issues in a primal-dual interior-point method for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- A full-step interior-point algorithm for linear complementarity problem based on a simple function
- A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- New complexity analysis of the primal-dual Newton method for linear optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A primal-dual interior-point method based on a new kernel function for linear complementarity problem
