Results 21 to 30 of about 27,291 (261)
Sensors, 2022 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
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
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
A superquadratic infeasible-interior-point method for linear complementarity problems [PDF]
Mathematical Programming, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen J. Wright 0001, Yin Zhang
openaire +1 more source
Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real-World Data. [PDF]
Adv Intell DiscovThis article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Ren Y, Wei GW.
europepmc +2 more sources
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
Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming [PDF]
, 2012 In this paper we will discuss two variants of an inexact feasible interior point algorithm for convex quadratic programming. We will consider two different neighbourhoods: a (small) one induced by the use of the Euclidean norm which yields a short-step ...
Andersen E. D., Jacek Gondzio
core +2 more sources
Slow Adaptive OFDMA Systems Through Chance Constrained Programming [PDF]
, 2009 Adaptive OFDMA has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wireless systems. The research over the last decade on adaptive OFDMA systems has focused on adapting the allocation of radio ...
Jun, Ying +4 more
core +2 more sources
Linear Optimization with Cones of Moments and Nonnegative Polynomials [PDF]
, 2014 Let A be a finite subset of N^n and R[x]_A be the space of real polynomials whose monomial powers are from A. Let K be a compact basic semialgebraic set of R^n such that R[x]_A contains a polynomial that is positive on K.
Nie, Jiawang
core +1 more source
Computational Complexity versus Statistical Performance on Sparse Recovery Problems [PDF]
, 2018 We show that several classical quantities controlling compressed sensing performance directly match classical parameters controlling algorithmic complexity.
Boumal, Nicolas +2 more
core +5 more sources