Explicit Solutions to Optimization Problems on the Intersections of the Unit Ball of the $l_1 $ and $l_\infty $ Norms with a Hyperplane
From MaRDI portal
Publication:3683909
DOI10.1137/0605058zbMath0567.90079OpenAlexW1989248834MaRDI QIDQ3683909
Publication date: 1984
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0605058
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Methods of successive quadratic programming type (90C55)
Related Items (4)
Error bounds on an approximation to the dominant eigenvector of a nonnegative matrix ⋮ An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound ⋮ Bounds on distances between eigenvalues ⋮ Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
- Explicit forms for ergodicity coefficients and spectrum localization
- Spectrum localization by ergodicity coefficients for stochastic matrices
- Coefficients of ergodicity with respect to vector norms
- Characterizations of optimal scalings of matrices
- A functional form for a particular coefficient of ergodicity
- Coefficients of ergodicity: structure and applications
- Perturbation bounds for the stationary probabilities of a finite Markov chain
This page was built for publication: Explicit Solutions to Optimization Problems on the Intersections of the Unit Ball of the $l_1 $ and $l_\infty $ Norms with a Hyperplane