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 conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization (Q743777) (← links)
- Level bundle-like algorithms for convex optimization (Q743968) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- A conjugate gradient method with sufficient descent property (Q747726) (← links)
- A globally convergent algorithm for MPCC (Q748600) (← links)
- A modified BFGS algorithm based on a hybrid secant equation (Q763667) (← links)
- A line search filter algorithm with inexact step computations for equality constrained optimization (Q765270) (← links)
- Some projection methods with the BB step sizes for variational inequalities (Q765311) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- A modified bat algorithm with conjugate gradient method for global optimization (Q779965) (← links)
- Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
- On the convergence of steepest descent methods for multiobjective optimization (Q782907) (← links)
- An augmented Lagrangian algorithm for multi-objective optimization (Q782908) (← links)
- Filter-based stochastic algorithm for global optimization (Q785632) (← links)
- Comparative assessment of algorithms and software for global optimization (Q813366) (← links)
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems (Q821530) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints (Q824557) (← links)
- A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations (Q824565) (← links)
- A new filter QP-free method for the nonlinear inequality constrained optimization problem (Q824828) (← links)
- A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions (Q826387) (← links)
- A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems (Q831261) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems (Q839891) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- An inexact Newton method for nonconvex equality constrained optimization (Q847853) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150) (← links)
- Sequential penalty quadratic programming filter methods for nonlinear programming (Q864206) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Q868465) (← links)
- A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations (Q870296) (← links)
- Efficient rank reduction of correlation matrices (Q875015) (← links)
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae (Q887119) (← links)
- Globally convergent evolution strategies for constrained optimization (Q887166) (← links)
- A new line search strategy for finding separating hyperplane in projection-based methods (Q891782) (← links)
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs (Q892382) (← links)
