Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
From MaRDI portal
Publication:1097170
zbMath0634.90042MaRDI QIDQ1097170
Publication date: 1987
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
probabilistic analysisgeneral principlescomplexity of algorithmslinear and combinatorial optimization
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items (25)
Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. ⋮ Optimal distributed execution of join queries ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Cascading-heuristics for the solution of staircase linear programs ⋮ Diameter and Curvature: Intriguing Analogies ⋮ On the condition of the zeros of characteristic polynomials ⋮ Doubly random polytopes ⋮ Universality for the Conjugate Gradient and MINRES Algorithms on Sample Covariance Matrices ⋮ A fast diagonal distance metric learning approach for large-scale datasets ⋮ Concentration and moderate deviations for Poisson polytopes and polyhedra ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ Polytopes and arrangements: diameter and curvature ⋮ Probability model selection using information-theoretic optimization criterion ⋮ On the probabilistic complexity of finding an approximate solution for linear programming ⋮ The combinatorial structure of random polytopes ⋮ Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems ⋮ The isotropic constant of random polytopes with vertices on convex surfaces ⋮ The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem ⋮ Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions ⋮ An efficient simplex type algorithm for sparse and dense linear programs. ⋮ On the oscillation of the expected number of extreme points of a random set ⋮ On the asymptotic average number of efficient vertices in multiple objective linear programming ⋮ Interior-point methods ⋮ Pivot versus interior point methods: Pros and cons ⋮ Poisson polyhedra in high dimensions
This page was built for publication: Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
