Pages that link to "Item:Q4768572"

The following pages link to An algorithm for finding the absolute extremum of a function (Q4768572):

Displaying 50 items.

• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• Matrix polynomials with specified eigenvalues (Q472455) (← links)
• A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
• Nearly optimal coverings of a sphere with generalized spherical segments (Q500603) (← links)
• Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity (Q537877) (← links)
• Multidimensional bisection: the performance and the context (Q686996) (← links)
• Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) (← links)
• Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
• Learning weights in the generalized OWA operators (Q812432) (← links)
• Adaptive global optimization based on a block-recursive dimensionality reduction scheme (Q828539) (← links)
• Univariate global optimization with multiextremal non-differentiable constraints without penalty functions (Q853549) (← links)
• Challenges of continuous global optimization in molecular structure prediction (Q877606) (← links)
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
• A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← links)
• Aggregation functions based on penalties (Q969571) (← links)
• On the convergence of global methods in multiextremal optimization (Q1078082) (← links)
• An algorithm for global optimization of Lipschitz continuous functions (Q1090241) (← links)
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
• On computing the dispersion function (Q1094128) (← links)
• Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (Q1102868) (← links)
• An interval maximum entropy method for a discrete minimax problem (Q1126620) (← links)
• On Timonov's algorithm for global optimization of univariate Lipschitz functions (Q1177913) (← links)
• An analytical approach to global optimization (Q1181733) (← links)
• Convergence rates of a global optimization algorithm (Q1186279) (← links)
• Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372) (← links)
• Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
• Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) (← links)
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison (Q1198733) (← links)
• The bisection method in higher dimensions (Q1198735) (← links)
• Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves (Q1201903) (← links)
• Interval-majorant method and global optimization (Q1263252) (← links)
• Global optimization requires global information (Q1264973) (← links)
• Global one-dimensional optimization using smooth auxiliary functions (Q1290603) (← links)
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
• Accelerations for a variety of global optimization methods (Q1315439) (← links)
• Accelerations for global optimization covering methods using second derivatives (Q1318273) (← links)
• On using estimates of Lipschitz constants in global optimization (Q1321252) (← links)
• Primal-relaxed dual global optimization approach (Q1321372) (← links)
• A parallel method for finding the global minimum of univariate functions (Q1321483) (← links)
• Finding maximum likelihood estimators for the three-parameter Weibull distribution (Q1342904) (← links)
• GOSH: derivative-free global optimization using multi-dimensional space-filling curves (Q1754461) (← links)
• Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
• A deterministic algorithm for global optimization (Q1803605) (← links)
• New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
• Towards pure adaptive search (Q1905968) (← links)
• Linearly constrained global minimization of functions with concave minorants (Q1918299) (← links)
• Global optimization of Hölder functions (Q1918982) (← links)
• A deterministic approach to global box-constrained optimization (Q1947630) (← links)
• An information global minimization algorithm using the local improvement technique (Q1959236) (← links)
• Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives (Q1962986) (← links)