Pages that link to "Item:Q5957563"

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

Displaying 50 items.

• Sobolev seminorm of quadratic functions with applications to derivative-free optimization (Q403635) (← links)
• A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence (Q408488) (← links)
• Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
• Accurate matrix exponential computation to solve coupled differential models in engineering (Q409808) (← links)
• Global convergence of a nonlinear conjugate gradient method (Q410397) (← links)
• An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
• A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335) (← links)
• The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
• Models and algorithms to improve earthwork operations in road design using mixed integer linear programming (Q421690) (← links)
• A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
• Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494) (← links)
• Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
• How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
• Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property (Q433285) (← links)
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints (Q434165) (← links)
• TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities (Q434175) (← links)
• Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
• A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775) (← links)
• Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
• Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization (Q442712) (← links)
• Global convergence of a spectral conjugate gradient method for unconstrained optimization (Q448802) (← links)
• A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
• Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
• On a method for constructing ensembles of regression models (Q462080) (← links)
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares (Q467412) (← links)
• An improved nonlinear conjugate gradient method with an optimal property (Q476750) (← links)
• A variance-based method to rank input variables of the mesh adaptive direct search algorithm (Q479211) (← links)
• Two modified three-term conjugate gradient methods with sufficient descent property (Q479259) (← links)
• A modified DIRECT algorithm with bilevel partition (Q480826) (← links)
• Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
• Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
• A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Solving DC programs using the cutting angle method (Q486726) (← links)
• Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
• Globally convergent evolution strategies (Q494335) (← links)
• Optimization of algorithms with OPAL (Q495935) (← links)
• A reliable affine relaxation method for global optimization (Q496103) (← links)
• A box-constrained differentiable penalty method for nonlinear complementarity problems (Q496621) (← links)
• Scheduling with task replication on desktop grids: theoretical and experimental analysis (Q498427) (← links)
• Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence (Q499680) (← links)
• A nonmonotone line search method for noisy minimization (Q499697) (← links)
• Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (Q501963) (← links)
• A trust-region approach with novel filter adaptive radius for system of nonlinear equations (Q501965) (← links)
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
• A new approach based on the Newton's method to solve systems of nonlinear equations (Q507837) (← links)
• Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method (Q508045) (← links)
• A quasi-Newton algorithm for large-scale nonlinear equations (Q509967) (← links)