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 branch-and-bound algorithm for the maximum capture problem with random utilities (Q322866) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Robust mixed-integer linear programming models for the irregular strip packing problem (Q323210) (← links)
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
- Computationally efficient algorithm for Gaussian process regression in case of structured samples (Q327224) (← links)
- An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- A three-term derivative-free projection method for nonlinear monotone system of equations (Q331805) (← links)
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Convergence properties of a class of nonlinear conjugate gradient methods (Q336596) (← links)
- Community detection by modularity maximization using GRASP with path relinking (Q336716) (← links)
- Relaxation approach for equilibrium problems with equilibrium constraints (Q336821) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- Fix-and-relax approaches for controlled tabular adjustment (Q337507) (← links)
- Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (Q337527) (← links)
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics (Q342321) (← links)
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
- Fuzzy LR linear systems: quadratic and least squares models to characterize exact solutions and an algorithm to compute approximate solutions (Q344046) (← links)
- A new nonmonotone spectral residual method for nonsmooth nonlinear equations (Q344250) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems (Q354989) (← links)
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems (Q356122) (← links)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A new hybrid evolutionary multiobjective algorithm guided by descent directions (Q367271) (← links)
- Scaling on the spectral gradient method (Q368739) (← links)
- A nonmonotone trust region method with new inexact line search for unconstrained optimization (Q369443) (← links)
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations (Q369446) (← links)
- An adaptive prediction-correction method for solving large-scale nonlinear systems of monotone equations with applications (Q370077) (← links)
- A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization (Q370232) (← links)
- A restoration-free filter SQP algorithm for equality constrained optimization (Q371507) (← links)
- Symmetric Perry conjugate gradient method (Q377723) (← links)
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
- Global convergence of a modified limited memory BFGS method for non-convex minimization (Q385195) (← links)
- A new class of nonlinear conjugate gradient coefficients with global convergence properties (Q387529) (← links)
- The convergence rate of a restart MFR conjugate gradient method with inexact line search (Q387662) (← links)
- Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- A model-hybrid approach for unconstrained optimization problems (Q403087) (← links)
- Sobolev seminorm of quadratic functions with applications to derivative-free optimization (Q403635) (← links)
