Pages that link to "Item:Q1304172"

The following pages link to Handbook of test problems in local and global optimization (Q1304172):

Displaying 50 items.

• On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch (Q2427178) (← links)
• Global optimization by continuous grasp (Q2458920) (← links)
• Multistart algorithms for seeking feasibility (Q2459378) (← links)
• Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
• Nonlinear optimization with GAMS /LGO (Q2460112) (← links)
• A new class of test functions for global optimization (Q2460145) (← links)
• A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
• A novel approach to bilevel nonlinear programming (Q2465482) (← links)
• Parametric global optimisation for bilevel programming (Q2465486) (← links)
• An affine scaling interior algorithm via Lanczos path for solving bound-constrained nonlinear systems (Q2470164) (← links)
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
• Application of deterministic low-discrepancy sequences in global optimization (Q2488052) (← links)
• A new auxiliary function method for systems of nonlinear equations (Q2514659) (← links)
• An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems (Q2566263) (← links)
• Tabu search directed by direct search methods for nonlinear global optimization (Q2572240) (← links)
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
• Imperialist competitive algorithm for solving systems of nonlinear equations (Q2629440) (← links)
• Multiagent algorithms for optimizing bundles of trajectories of deterministic systems with incomplete instant feedback (Q2695103) (← links)
• Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (Q2796798) (← links)
• A “Joint+Marginal” Approach in Optimization (Q2802528) (← links)
• Border Basis for Polynomial System Solving and Optimization (Q2819219) (← links)
• Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
• Survey of Piecewise Convex Maximization and PCMP over Spherical Sets (Q2958613) (← links)
• Comparison of deterministic and stochastic approaches to global optimization (Q3025042) (← links)
• Feasibility and Dominance Rules in the Electromagnetism-Like Algorithm for Constrained Global Optimization (Q3512539) (← links)
• Global Optimization in Practice:State of the Art and Perspectives (Q3565460) (← links)
• A method for solving bilevel linear programming problems (Q3602259) (← links)
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint (Q3635703) (← links)
• Approximate norm descent methods for constrained nonlinear systems (Q4605702) (← links)
• A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
• Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← links)
• Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain (Q4966769) (← links)
• BOLIB: Bilevel Optimization LIBrary of Test Problems (Q5014641) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem (Q5038438) (← links)
• Finding all global optima of engineering design problems with discrete signomial terms (Q5059294) (← links)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
• Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
• (Q5155992) (← links)
• Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
• Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
• Local optima smoothing for global optimization (Q5717532) (← links)
• Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
• An adaptive learning rate backpropagation‐type neural network for solving <b><i>n</i> × <i>n</i></b> systems on nonlinear algebraic equations (Q5739238) (← links)
• A new filled function method for global optimization (Q5894539) (← links)
• On new iterative method for solving systems of nonlinear equations (Q5962126) (← links)
• Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
• A method of sequential log-convex programming for engineering design (Q6050371) (← links)
• Application of one‐step method to parameter estimation in ODE models (Q6089166) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)