Results 11 to 20 of about 17,647,919 (136)
Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefania Bellavia, Sandra Pieraccini
openaire +5 more sources
An infeasible full NT-step interior point method for circular optimization
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kheirfam, Behrouz, Wang, Guoqiang
openaire +5 more sources
Detecting Infeasibility in Infeasible-Interior-Point Methods for Optimization [PDF]
Detecting Infeasibility in Infeasible-Interior-Point Methods for ...
Todd, M. J.
core +5 more sources
Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric Cones [PDF]
Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric ...
Rangarajan, B.
core +5 more sources
Convergence of infeasible-interior-point methods for self-scaled conic programming [PDF]
Convergence of infeasible-interior-point methods for self-scaled conic ...
Todd, M. J., Rangarajan, B.K.
core +6 more sources
The creation of accurate three-dimensional models has been radically simplified in recent years by developing photogrammetric methods. However, the photogrammetric procedure requires complex data processing and does not provide an immediate 3D model, so ...
Piotr Łabędź +5 more
doaj +1 more source
An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear Programming [PDF]
An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear ...
Tutuncu, R.
core +6 more sources
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
Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asadi, A.R. (author), Roos, C. (author)
openaire +4 more sources
Counterexample to a Conjecture on an Infeasible Interior-Point Method
In [SIAM J. Optim., 16 (2006), pp. 1110–1136], 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

