Location of the Maximum on Unimodal Surfaces
From MaRDI portal
Publication:5514035
DOI10.1145/321281.321291zbMath0139.10402OpenAlexW2055582487MaRDI QIDQ5514035
Publication date: 1965
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321281.321291
Related Items
A modification of the inscribed ellipsoid method, Unnamed Item, Set variational inequalities, A projection cutting plane algorithm for convex programming problems, Complexity estimates of some cutting plane methods based on the analytic barrier, Subgradient ellipsoid method for nonsmooth convex problems, Survey of the Theory of Extremal Problems, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, Unnamed Item, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, Randomized methods based on new Monte Carlo schemes for control and optimization, On the complexity of simultaneous price-quantity adjustment processes, A utility theory based interactive approach to robustness in linear optimization, The complexity of a special convex programming problem connected with nonlinear optimization, Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models, Approximation methods for the unconstrained optimization, Optimal sequential and parallel search for finding a root, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Synthesis of cutting and separating planes in a nonsmooth optimization method, An optimal algorithm for search of extrema of a bimodal function, Methods of centers for variational inequalities and linear programming, Modifications and implementation of the ellipsoid algorithm for linear programming, Unnamed Item
