Results 1 to 10 of about 44,435 (133)
An infeasible interior point methods for convex quadratic problems
Journal of Numerical Analysis and Approximation Theory, 2018 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 +4 more sources
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization [PDF]
Entropy, 2023 Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior point methods (IPMs) yield a fundamental family of polynomial-time algorithms for solving optimization problems. IPMs solve a
Zeguan Wu +4 more
doaj +2 more sources
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 +2 more sources
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs [PDF]
Sahand Communications in Mathematical Analysis, 2019 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 +2 more sources
Communications in Combinatorics and Optimization, 2018 An infeasible interior-point algorithm for solving the $P_*$-matrix linear complementarity problem based on a kernel function with trigonometric barrier term is analyzed.
B. Kheirfam, M. Haghighi
doaj +2 more sources
Iteration Complexity of an Infeasible Interior Point Methods for Seconder-order Cone Programming and its Warmstarting [PDF]
arXiv.org, 2022 This paper studies the worst case iteration complexity of an infeasible interior point method (IPM) for seconder order cone programming (SOCP), which is more convenient for warmstarting compared with feasible IPMs.
Yushu Chen +4 more
semanticscholar +1 more source
An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems [PDF]
Computational optimization and applications, 2023 An arc-search interior-point method is a type of interior-point method that approximates the central path by an ellipsoidal arc, and it can often reduce the number of iterations.
E. Iida, M. Yamashita
semanticscholar +1 more source
Safe Bayesian Optimization Using Interior-Point Methods—Applied to Personalized Insulin Dose Guidance [PDF]
IEEE Control Systems Letters, 2022 This letter considers the problem of Bayesian optimization for systems with safety-critical constraints, where both the objective function and the constraints are unknown, but can be observed by querying the system.
D. Krishnamoorthy, F. Doyle
semanticscholar +1 more source
Faster Randomized Interior Point Methods for Tall/Wide Linear Programs [PDF]
Journal of machine learning research, 2022 Linear programming (LP) is an extremely useful tool which has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such as ...
Agniva Chowdhury +4 more
semanticscholar +1 more source
A new search direction for full-Newton step infeasible interior-point method in linear optimization
Croatian Operational Research Review, 2023 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