Pages that link to "Item:Q5957563"

The following pages link to Benchmarking optimization software with performance profiles. (Q5957563):

Displaying 33 items.

• A branch-and-bound algorithm for the maximum capture problem with random utilities (Q322866) (← links)
• Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (Q337527) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
• Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494) (← links)
• New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
• Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (Q530424) (← links)
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
• Applying powell's symmetrical technique to conjugate gradient methods (Q540656) (← links)
• Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
• A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
• A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
• Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
• Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
• An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
• A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations (Q1751397) (← links)
• Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
• Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization (Q1760876) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• An efficient conjugate gradient trust-region approach for systems of nonlinear equation (Q2313481) (← links)
• A novel self-adaptive trust region algorithm for unconstrained optimization (Q2336586) (← links)
• A particle swarm pattern search method for bound constrained global optimization (Q2454725) (← links)
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← links)
• Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach (Q3458811) (← links)
• Feasibility and Dominance Rules in the Electromagnetism-Like Algorithm for Constrained Global Optimization (Q3512539) (← links)
• Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction (Q5266366) (← links)
• A filter-trust-region method for simple-bound constrained optimization (Q5437529) (← links)