Results 21 to 30 of about 44,584 (264)
Statistics, Optimization and Information Computing, 2021 In this paper, an improved Interior-Point Method (IPM) for solving symmetric optimization problems is presented. Symmetric optimization (SO) problems are linear optimization problems over symmetric cones.
Lesaja Goran, G.Q. Wang, A. Oganian
semanticscholar +1 more source
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
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
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
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
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
Revisiting interval protection, a.k.a. partial cell suppression, for tabular data [PDF]
, 2016 The final publication is available at link.springer.comInterval protection or partial cell suppression was introduced in “M. Fischetti, J.-J. Salazar, Partial cell suppression: A new methodology for statistical disclosure control, Statistics and ...
Castro Pérez, Jordi +1 more
core +1 more source
Bad semidefinite programs: they all look the same [PDF]
, 2017 Conic linear programs, among them semidefinite programs, often behave pathologically: the optimal values of the primal and dual programs may differ, and may not be attained. We present a novel analysis of these pathological behaviors.
Bauschke H. +6 more
core +3 more sources
Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear Optimization [PDF]
Journal of Optimization Theory and Applications, 2008 This article studies the use of a primal-dual interior point method for solving large scale linear programs. The article begins with a presentation of the background to this problem and an overview of the existing literature, including the use of Preconditioned Conjugate Gradients (PCG) for inexact infeasible path-following algorithms.
Al-Jeiroudi, G., Gondzio, J.
openaire +2 more sources
Introducing the sequential linear programming level-set method for topology optimization [PDF]
, 2014 The authors would like to thank Numerical Analysis Group at the Rutherford Appleton Laboratory for their FORTRAN HSL packages (HSL, a collection of Fortran codes for large-scale scientific computation. See http://www.hsl.rl.ac.uk/).
Dunning, Peter D., Kim, H. Alicia
core +3 more sources