Results 21 to 30 of about 26,938 (149)
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.
Wright, Stephen, Zhang, Yin
openaire +3 more sources
Infeasible constraint-reduced interior-point methods for linear optimization [PDF]
Optimization Methods and Software, 2012 In this paper, building on a general framework which encompasses several previously proposed approaches for dual-feasible constraint-reduced interior-point optimization, for which we prove convergence to a single point of the sequence of dual iterates, we propose a framework for ‘infeasible’ constraint-reduced interior-point optimization.
Meiyun Y. He, André L. Tits
openaire +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
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
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
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
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
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
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