Results 11 to 20 of about 26,453 (192)
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
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2015 In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is
Asadi S., Mansouri H.
doaj +1 more source
New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization [PDF]
Yugoslav Journal of Operations Research, 2018 We present a full Nesterov-Todd (NT) step infeasible interior-point algorithm for second-order cone optimization based on a different way to calculate feasibility direction. In each iteration of the algorithm we use the largest possible barrier parameter
Kheirfam Behrouz
doaj +1 more source
Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood [PDF]
Journal of Optimization Theory and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asadi, A.R. (author), Roos, C. (author)
openaire +4 more sources
Mathematics, 2022 This work presents a generalized implementation of the infeasible primal-dual interior point method (IPM) achieved by the use of non-Archimedean values, i.e., infinite and infinitesimal numbers.
Lorenzo Fiaschi, Marco Cococcioni
doaj +1 more source
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
Croatian 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
Counterexample to a Conjecture on an Infeasible Interior-Point Method
SIAM Journal on Optimization, 2010 Summary: In [the second author, SIAM J. Optim. 16, No.~4, 1110--1136 (2006; Zbl 1131.90029)], Roos proved that the devised full-step infeasible algorithm has \(O(n)\) worst-case iteration complexity. This complexity bound depends linearly on a parameter \(\bar{\kappa}(\zeta)\), which is proved to be less than \(\sqrt{2n}\).
Gu, G. (author), Roos, C. (author)
openaire +4 more sources
Sensors, 2021 Target localization plays a vital role in ocean sensor networks (OSNs), in which accurate position information is not only a critical need of ocean observation but a necessary condition for the implementation of ocean engineering.
Yuanyuan Zhang +6 more
doaj +1 more source
ISPRS Open Journal of Photogrammetry and Remote Sensing, 2022 Historical terrestrial images are the only visual sources documenting alpine environments shortly after the end of the Little Ice Age. Despite their unique value, they are largely unused for quantifying environmental changes because of the difficult and ...
Sebastian Mikolka-Flöry +3 more
doaj +1 more source
Random projections for linear programming [PDF]
, 2017 Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows.
Liberti, Leo +2 more
core +4 more sources