Algorithms for convex optimization

DOI10.1017/9781108699211MaRDI QIDQ4997179zbMATH OpenOpenAlexFDO

Authors Nisheeth K. Vishnoi

Publication date 28 June 2021

Full work available at URL https://doi.org/10.1017/9781108699211

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convex programming (90C25)

Recommendations

• Convex optimization: algorithms and complexity
• Lectures on convex optimization
• Large-scale convex optimization. Algorithms \& analyses via monotone operators
• scientific article; zbMATH DE number 2107836
• Convex optimization algorithms

Cited in

(13)

• Lower bounds for contingency tables via Lorentzian polynomials
• Convex optimization: algorithms and complexity
• scientific article; zbMATH DE number 7030501 (Why is no real title available?)
• On the computability of continuous maximum entropy distributions with applications
• An Optimal Algorithm for Constrained Differentiable Convex Optimization
• Verified reductions for optimization
• Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
• The power of proportional fairness for nonclairvoyant polytope scheduling
• Finite-time controllability scores of large-scale switched systems
• Fast gradient computation for Gromov-Wasserstein distance
• Discrete convex subdifferentials and optimality
• Online algorithms for spectral hypergraph sparsification
• Time-efficient algorithms for Nash-bargaining-based matching market models

This page was built for publication: Algorithms for convex optimization

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