Pages that link to "Item:Q1918926"

The following pages link to A new algorithm for minimizing convex functions over convex sets (Q1918926):

Displaying 37 items.

• Randomized interior point methods for sampling and optimization (Q259600) (← links)
• Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
• Models and algorithms for distributionally robust least squares problems (Q403637) (← links)
• A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
• A class of volumetric barrier decomposition algorithms for stochastic quadratic programming (Q884639) (← links)
• Logarithmic regret algorithms for online convex optimization (Q1009221) (← links)
• A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
• Computing sharp bounds for hard clustering problems on trees (Q1028427) (← links)
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• Volumetric path following algorithms for linear programming (Q1361113) (← links)
• The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
• Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
• Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
• Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other (Q2069678) (← links)
• A simple method for convex optimization in the oracle model (Q2164690) (← links)
• On risk-averse stochastic semidefinite programs with continuous recourse (Q2296250) (← links)
• A note on approximation of a ball by polytopes (Q2386205) (← links)
• A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
• A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
• A survey on models and algorithms for discrete evacuation planning network problems (Q2514655) (← links)
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
• Heat flow and a faster algorithm to compute the surface area of a convex body (Q2868081) (← links)
• A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming (Q3015050) (← links)
• Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
• A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere (Q4020141) (← links)
• (Q4558208) (← links)
• Fast Core Pricing for Rich Advertising Auctions (Q5031009) (← links)
• First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
• Testing the manifold hypothesis (Q5741444) (← links)
• A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)
• On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)
• A simple method for convex optimization in the oracle model (Q6589751) (← links)
• Accuracy certificates for convex minimization with inexact oracle (Q6661688) (← links)