Pages that link to "Item:Q5957563"
From MaRDI portal
The following pages link to Benchmarking optimization software with performance profiles. (Q5957563):
Displaying 50 items.
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints (Q1675425) (← links)
- An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
- A double parameter scaled BFGS method for unconstrained optimization (Q1677470) (← links)
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix (Q1677473) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization (Q1681785) (← links)
- On a smoothed penalty-based algorithm for global optimization (Q1683321) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (Q1686668) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- On the construction of quadratic models for derivative-free trust-region algorithms (Q1688943) (← links)
- A new restarting adaptive trust-region method for unconstrained optimization (Q1689065) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems (Q1694391) (← links)
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
- Discovery of new complementarity functions for NCP and SOCCP (Q1715644) (← links)
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class (Q1715715) (← links)
- An improved three-term derivative-free method for solving nonlinear equations (Q1715726) (← links)
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions (Q1715789) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
- Improved optimization methods for image registration problems (Q1717565) (← links)
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization (Q1718269) (← links)
- A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models (Q1720966) (← links)
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems (Q1720973) (← links)
- A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (Q1721017) (← links)
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence (Q1722876) (← links)
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization (Q1723529) (← links)
- A hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← links)
- On the strong convergence of a sufficient descent Polak-Ribière-Polyak conjugate gradient method (Q1723758) (← links)
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812) (← links)
- The hybrid BFGS-CG method in solving unconstrained optimization problems (Q1724270) (← links)
- A new method with sufficient descent property for unconstrained optimization (Q1725328) (← links)
- A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems (Q1725601) (← links)
- MILP models for the selection of a small set of well-distributed points (Q1727947) (← links)
- Descent line search scheme using Geršgorin circle theorem (Q1728356) (← links)
- Quasi-Newton methods for multiobjective optimization problems (Q1728407) (← links)
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods (Q1730830) (← links)
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832) (← links)
