A Randomized Algorithm to Optimize Over Certain Convex Sets

DOI10.1287/MOOR.20.3.529MaRDI QIDQ4864870zbMATH OpenOpenAlexDBLPWikidataFDO

Authors John A. Mount, R. Kannan, Sridhar R. Tayur

Publication date 16 September 1996

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.20.3.529

zbMATH Keywords

component commonality problemrandomized polynomial time algorithm

Mathematics Subject Classification ID

Stochastic programming (90C15) Convex programming (90C25)

Recommendations

• A simple randomised algorithm for convex optimisation
• Solving convex programs by random walks
• A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
• A Subexponential Algorithm for Abstract Optimization Problems
• A randomized cutting plane method with probabilistic geometric convergence

Cited in

(11)

• Randomized algorithms for the separation of point sets and for solving quadratic programs
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• An algorithm for maximizing a convex function over a simple set
• Random optimization on random sets
• Random algorithms for solving convex inequalities
• Combinatorial Optimization Over Two Random Point Sets
• A randomized cutting plane method with probabilistic geometric convergence
• Jordan-algebraic aspects of optimization: randomization
• scientific article; zbMATH DE number 1305090 (Why is no real title available?)
• A simple randomised algorithm for convex optimisation
• Solving convex programs by random walks

This page was built for publication: A Randomized Algorithm to Optimize Over Certain Convex Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864870)