Results 21 to 30 of about 15,480,478 (99)
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
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods [PDF]
Mathematical Programming, 2019 We analyze sequences generated by interior point methods (IPMs) in convex and nonconvex settings. We prove that moving the primal feasibility at the same rate as the barrier parameter $μ$ ensures the Lagrange multiplier sequence remains bounded, provided the limit point of the primal sequence has a Lagrange multiplier.
Gabriel Haeser +2 more
openaire +4 more sources
Computing Weighted Analytic Center for Linear Matrix Inequalities Using Infeasible Newton’s Method
Journal of Mathematics, 2015 We study the problem of computing weighted analytic center for system of linear matrix inequality constraints. The problem can be solved using Standard Newton’s method.
Shafiu Jibrin
doaj +1 more source
New complexity analysis of a full Nesterov- Todd step infeasible interior-point algorithm for symmetric optimization [PDF]
, 1997 summary:A full Nesterov-Todd step infeasible interior-point algorithm is proposed for solving linear programming problems over symmetric cones by using the Euclidean Jordan algebra.
Faybusovich, Leonid +3 more
core +1 more source
پژوهشهای ریاضی, 2021 By using a new search direction, we propose an infeasible interior-point method for monotone linear complementarity problem. The algorithm uses only one feasibility step in each iteration, and we prove that it suffices in order to obtain a polynomial ...
Nezameddin Mahdavi-Amiri +1 more
doaj
Journal of Inequalities and Applications, 2017 In this paper, we propose a Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization using the arc-search strategy.
Ximei Yang, Yinkui Zhang
doaj +1 more source
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 +1 more source
Optimal Control of Ascent Trajectory for Launch Vehicles: A Convex Approach
IEEE Access, 2019 This paper presents an online ascent trajectory optimization algorithm based on optimal control and convex optimization without accurate initial guesses.
Yuan Li +3 more
doaj +1 more source