Pages that link to "Item:Q5957563"

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

Displaying 50 items.

• An adaptive trust region method based on simple conic models (Q894560) (← links)
• A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (Q896192) (← links)
• Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
• Interiors of completely positive cones (Q897047) (← links)
• A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
• An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (Q898716) (← links)
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
• An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
• An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
• A new conjugate gradient algorithm for training neural networks based on a modified secant equation (Q905328) (← links)
• A globally convergent inexact Newton method with a new choice for the forcing term (Q940862) (← links)
• A derivative-free algorithm for systems of nonlinear inequalities (Q941047) (← links)
• An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
• Computing proximal points of nonconvex functions (Q959941) (← links)
• A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
• A retrospective trust-region method for unconstrained optimization (Q964178) (← links)
• Numerical comparisons of two effective methods for mixed complementarity problems (Q966077) (← links)
• Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
• Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
• Global convergence of a robust filter SQP algorithm (Q976392) (← links)
• On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
• Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
• Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
• New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
• A Matrix Partitioning Interface to PaToH in MATLAB (Q991106) (← links)
• Global convergence of a tri-dimensional filter SQP algorithm based on the line search method (Q999072) (← links)
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems (Q1001321) (← links)
• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems (Q1004008) (← links)
• A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← links)
• Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities (Q1012237) (← links)
• Two modified Dai-Yuan nonlinear conjugate gradient methods (Q1014353) (← links)
• Solving bilevel linear programs using multiple objective linear programming (Q1016404) (← links)
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
• A filter inexact-restoration method for nonlinear programming (Q1024701) (← links)
• BFGS trust-region method for symmetric nonlinear equations (Q1026429) (← links)
• A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
• A modified PRP conjugate gradient method (Q1026553) (← links)
• Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← links)
• Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
• Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
• A truncated descent HS conjugate gradient method and its global convergence (Q1036485) (← links)
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
• On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming (Q1040974) (← links)
• A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
• Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search (Q1049322) (← links)
• Inverse \(q\)-columns updating methods for solving nonlinear systems of equations (Q1410869) (← links)