Pages that link to "Item:Q5957563"
From MaRDI portal
The following pages link to Benchmarking optimization software with performance profiles. (Q5957563):
Displaying 50 items.
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Multi-pattern generation framework for logical analysis of data (Q513641) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- A limited memory descent Perry conjugate gradient method (Q518141) (← links)
- On optimality of two adaptive choices for the parameter of Dai-Liao method (Q518148) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- An improved adaptive trust-region algorithm (Q519772) (← links)
- On the multi-point Levenberg-Marquardt method for singular nonlinear equations (Q520266) (← links)
- Supermemory gradient methods for monotone nonlinear equations with convex constraints (Q520272) (← links)
- An inexact restoration derivative-free filter method for nonlinear programming (Q520323) (← links)
- A new trust-region method for solving systems of equalities and inequalities (Q520331) (← links)
- Preconditioning techniques based on the Birkhoff-von Neumann decomposition (Q521649) (← links)
- An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
- A variation on the interior point method for linear programming using the continued iteration (Q522093) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← links)
- Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods (Q523183) (← links)
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update (Q523565) (← links)
- Structured regularization for barrier NLP solvers (Q523568) (← links)
- Partitioned quasi-Newton methods for sparse nonlinear equations (Q523572) (← links)
- A nonmonotone Jacobian smoothing inexact Newton method for NCP (Q523575) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← links)
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (Q530424) (← links)
- A modified three-term conjugate gradient method with sufficient descent property (Q530722) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- A modified CG-DESCENT method for unconstrained optimization (Q535462) (← links)
- A practical method for solving large-scale TRS (Q537634) (← links)
- A global optimization method for the design of space trajectories (Q538297) (← links)
- Sufficient descent directions in unconstrained optimization (Q538309) (← links)
- Exploiting separability in large-scale linear support vector machine training (Q540649) (← links)
- Applying powell's symmetrical technique to conjugate gradient methods (Q540656) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Combining and scaling descent and negative curvature directions (Q543412) (← links)
- An augmented Lagrangian fish swarm based method for global optimization (Q555135) (← links)
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476) (← links)
- A new two-step gradient-type method for large-scale unconstrained optimization (Q604019) (← links)
- Spectral scaling BFGS method (Q604256) (← links)
- Two modified HS type conjugate gradient methods for unconstrained optimization problems (Q611200) (← links)
- A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
- Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
- Orbital branching (Q623461) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- New quasi-Newton methods via higher order tensor models (Q629502) (← links)
- Improved Hessian approximation with modified secant equations for symmetric rank-one method (Q629505) (← links)
- Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← links)
- Efficient orthogonal matrix polynomial based method for computing matrix exponential (Q632884) (← links)
