Pages that link to "Item:Q1813720"

The following pages link to The globally convexized filled functions for global optimization (Q1813720):

Displaying 50 items.

• Global descent method for constrained continuous global optimization (Q278323) (← links)
• An integral function and vector sequence method for unconstrained global optimization (Q540707) (← links)
• A one-parameter filled function for nonsmooth global optimization and its application (Q545434) (← links)
• Global descent methods for unconstrained global optimization (Q548179) (← links)
• A filled function method for finding a global minimizer on global integer optimization (Q557731) (← links)
• The filled function transformations for constrained global optimization (Q751199) (← links)
• An augmented filled function for global nonlinear integer optimization (Q828743) (← links)
• A novel filled function method and quasi-filled function method for global optimization (Q853545) (← links)
• Unification of filled function and tunnelling function in global optimization (Q871668) (← links)
• A new discrete filled function algorithm for discrete global optimization (Q875372) (← links)
• A integral filter algorithm for unconstrained global optimization (Q879465) (← links)
• Finding more and more solutions of a system of nonlinear equations (Q919747) (← links)
• A filled function method for constrained global optimization (Q925228) (← links)
• Some applications of a polynomial inequality to global optimization (Q948639) (← links)
• A new constructing auxiliary function method for global optimization (Q949509) (← links)
• A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
• New filled functions for nonsmooth global optimization (Q965609) (← links)
• Finding global minimizer with one-parameter filled function on unconstrained global optimization (Q990416) (← links)
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
• A cut-peak function method for global optimization (Q1026439) (← links)
• An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
• A parallel global optimization algorithm for rational separable- factorable functions (Q1123549) (← links)
• A new filled function applied to global optimization. (Q1422382) (← links)
• Filled functions for unconstrained global optimization (Q1589810) (← links)
• A direct search algorithm for global optimization (Q1736805) (← links)
• A filled function method dominated by filter for nonlinearly global optimization (Q1756190) (← links)
• New modified function method for global optimization (Q1781868) (← links)
• A parallel computing scheme for minimizing a class of large scale functions (Q1822903) (← links)
• A continuous approach to nonlinear integer programming (Q1824556) (← links)
• Revised filled function methods for global optimization. (Q1854956) (← links)
• A computable filled function used for global minimization (Q1855165) (← links)
• Continuous action set learning automata for stochastic optimization (Q1898166) (← links)
• Modified T-F function method for finding global minimizer on unconstrained optimization (Q1958866) (← links)
• A new filled function method for constrained nonlinear equations (Q2018996) (← links)
• A modified tunneling function method for non-smooth global optimization and its application in artificial neural network (Q2285350) (← links)
• Simple transformation functions for finding better minima (Q2425403) (← links)
• Finding discrete global minima with a filled function for integer programming (Q2477662) (← links)
• A smoothing method of global optimization that preserves global minima (Q2494297) (← links)
• A criterion for an approximation global optimal solution based on the filled functions (Q2515291) (← links)
• A class of filled functions for box constrained continuous global optimization (Q2572330) (← links)
• Two-parameters quasi-filled function algorithm for nonlinear integer programming (Q2644510) (← links)
• Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem (Q3602102) (← links)
• An efficient dynamical evolutionary algorithm for global optimization (Q4467339) (← links)
• Finding global minima with a new dynamical evolutionary algorithm (Q4789543) (← links)
• A new auxiliary function method for general constrained global optimization (Q4916316) (← links)
• A gradually descent method for discrete global optimization (Q5436248) (← links)
• The combination stretching function technique with simulated annealing algorithm for global optimization (Q5746719) (← links)
• A new filled function method for global optimization (Q5894539) (← links)
• A new filled function method for unconstrained global optimization (Q5920527) (← links)
• A class of generalized filled functions with improved computability (Q5953950) (← links)