Pages that link to "Item:Q5514035"
From MaRDI portal
The following pages link to Location of the Maximum on Unimodal Surfaces (Q5514035):
Displaying 24 items.
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Randomized methods based on new Monte Carlo schemes for control and optimization (Q666376) (← links)
- On the complexity of simultaneous price-quantity adjustment processes (Q684756) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models (Q1207805) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- Optimal sequential and parallel search for finding a root (Q1248895) (← links)
- Methods of centers for variational inequalities and linear programming (Q1294369) (← links)
- Set variational inequalities (Q1366827) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- An optimal algorithm for search of extrema of a bimodal function (Q1821513) (← links)
- A modification of the inscribed ellipsoid method (Q1900254) (← links)
- A projection cutting plane algorithm for convex programming problems (Q1914623) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- (Q3796971) (← links)
- The complexity of a special convex programming problem connected with nonlinear optimization (Q3835664) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)
- Survey of the Theory of Extremal Problems (Q4604744) (← links)
- (Q5219717) (← links)
- (Q5557555) (← links)
- Subgradient ellipsoid method for nonsmooth convex problems (Q6038646) (← links)