Pages that link to "Item:Q1812075"

The following pages link to New classes of globally convexized filled functions for global optimization (Q1812075):

Displaying 33 items.

• New global optimization methods for ship design problems (Q374643) (← links)
• A new filled function method with two parameters for global optimization (Q481773) (← links)
• A filling function method for unconstrained global optimization (Q493693) (← links)
• An integral function and vector sequence method for unconstrained global optimization (Q540707) (← 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)
• A filled function method for global optimization with inequality constraints (Q725788) (← 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 integral filter algorithm for unconstrained global optimization (Q879465) (← links)
• Discrete global optimization problems with a modified discrete filled function (Q888308) (← links)
• A filled function method for constrained global optimization (Q925228) (← links)
• A revised cut-peak function method for box constrained continuous global optimization (Q990665) (← links)
• New modified function method for global optimization (Q1781868) (← links)
• A new filled function method for constrained nonlinear equations (Q2018996) (← links)
• Minimum-time spacecraft attitude motion planning using objective alternation in derivative-free optimization (Q2055362) (← links)
• Global optimization of protein-peptide docking by a filling function method (Q2342145) (← links)
• Simple transformation functions for finding better minima (Q2425403) (← links)
• Two-parameters quasi-filled function algorithm for nonlinear integer programming (Q2644510) (← links)
• Finding global minima with an inflection point-based filled function algorithm (Q2679831) (← links)
• An approach to solve local and global optimization problems based on exact objective filled penalty functions (Q2691319) (← links)
• Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem (Q3602102) (← links)
• A new auxiliary function method for general constrained global optimization (Q4916316) (← links)
• A new parameter free filled function for solving unconstrained global optimization problems (Q5031235) (← links)
• A new filled function for global minimization and system of nonlinear equations (Q5057969) (← links)
• A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization (Q5084355) (← links)
• Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems (Q5085235) (← links)
• A gradually descent method for discrete global optimization (Q5436248) (← links)
• A new filled function method for global optimization (Q5894539) (← links)
• A new filled function method for unconstrained global optimization (Q5895063) (← links)
• Global optimization based on local searches (Q5920293) (← links)
• Global optimization based on local searches (Q5925165) (← links)
• A novel one-parameter filled function method with an application to pathological analysis (Q6124343) (← links)