Pages that link to "Item:Q433950"

The following pages link to Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950):

Displaying 28 items.

• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
• Lipschitz global optimization methods in control problems (Q386913) (← links)
• A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
• On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
• Application of reduced-set Pareto-Lipschitzian optimization to truss optimization (Q506481) (← links)
• MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
• Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants (Q727093) (← links)
• Diagonal generalizaton of the DIRECT method for problems with constraints (Q828532) (← links)
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
• A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
• A global optimization algorithm for multivariate functions with Lipschitzian first derivatives (Q1359125) (← links)
• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
• Geodesic and contour optimization using conformal mapping (Q1675629) (← links)
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
• Incremental method for multiple line detection problem -- iterative reweighted approach (Q1998212) (← links)
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
• A \textsc{direct}-type global optimization algorithm for image registration (Q2022242) (← links)
• Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions (Q2128765) (← links)
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
• Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
• Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem (Q2423794) (← links)
• Optimization challenges in the structured low rank approximation problem (Q2434635) (← links)
• On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
• Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
• Continuation Newton methods with deflation techniques for global optimization problems (Q6653270) (← links)