Pages that link to "Item:Q5957563"

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

Displaying 50 items.

• A partitioned PSB method for partially separable unconstrained optimization problems (Q1733684) (← links)
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
• A globally convergent Levenberg-Marquardt method for equality-constrained optimization (Q1734774) (← links)
• MAKHA -- a new hybrid swarm intelligence global optimization algorithm (Q1736664) (← links)
• Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
• Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
• Numerical comparisons based on four smoothing functions for absolute value equation (Q1743358) (← links)
• A new derivative-free SCG-type projection method for nonlinear monotone equations with convex constraints (Q1743362) (← links)
• A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues (Q1744053) (← links)
• Global convergence property of scaled two-step BFGS method (Q1744145) (← links)
• An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints (Q1744880) (← links)
• A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties (Q1744902) (← links)
• Augmented Lagrangian and exact penalty methods for quasi-variational inequalities (Q1744910) (← links)
• A new efficient and accurate spline algorithm for the matrix exponential computation (Q1747317) (← links)
• Jagged non-zero submatrix data structure (Q1749313) (← links)
• An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains (Q1749514) (← links)
• Variable sample size method for equality constrained optimization problems (Q1749777) (← links)
• An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization (Q1751056) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (Q1751159) (← links)
• Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
• Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
• A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations (Q1751397) (← links)
• Optimization model for a production, inventory, distribution and routing problem in small furniture companies (Q1752350) (← links)
• Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
• Two smooth support vector machines for \(\varepsilon \)-insensitive regression (Q1753072) (← links)
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (Q1753434) (← links)
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
• An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections (Q1756351) (← links)
• A simplicial homology algorithm for Lipschitz optimisation (Q1756767) (← links)
• Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
• Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
• Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395) (← links)
• Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
• Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization (Q1760876) (← links)
• Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
• A starting point strategy for nonlinear interior methods. (Q1767154) (← links)
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
• A comparison of complete global optimization solvers (Q1780958) (← links)
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
• A new family of conjugate gradient methods for unconstrained optimization (Q1786950) (← links)
• Two adaptive Dai-Liao nonlinear conjugate gradient methods (Q1787816) (← links)
• Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
• On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)