Pages that link to "Item:Q5270776"

The following pages link to A Note on Performance Profiles for Benchmarking Software (Q5270776):

Displaying 32 items.

• OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
• A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length (Q2009059) (← links)
• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization (Q2044473) (← links)
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
• A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
• On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
• Bi-objective optimization for road vertical alignment design (Q2147028) (← links)
• Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
• A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization (Q2218904) (← links)
• Benchmarking optimization software -- a (Hi)story (Q2225640) (← links)
• A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
• On FISTA with a relative error rule (Q2696903) (← links)
• $LDL^T$ Direction Interior Point Method for Semidefinite Programming (Q4609469) (← links)
• An adaptive nonmonotone trust region algorithm (Q4622885) (← links)
• Conflict Analysis for MINLP (Q4995080) (← links)
• Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
• On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
• Improving the Dai-Liao parameter choices using a fixed point equation (Q5080095) (← links)
• On atomic cliques in temporal graphs (Q6043101) (← links)
• (Q6091758) (← links)
• Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions (Q6094491) (← links)
• Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)
• Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)
• Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)