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 multi-objective \textbf{DIRECT} algorithm for ship hull optimization (Q1790670) (← links)
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications (Q1790676) (← links)
- An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- Active-set Newton methods for mathematical programs with vanishing constraints (Q1928752) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Constrained dogleg methods for nonlinear systems with simple bounds (Q1935576) (← links)
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization (Q1935888) (← links)
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
- Nonmonotone spectral method for large-scale symmetric nonlinear equations (Q1938081) (← links)
- On the simplex algorithm initializing (Q1938217) (← links)
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems (Q1938919) (← links)
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds (Q1941187) (← links)
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257) (← links)
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties (Q1949585) (← links)
- Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
- On the solution of linearly constrained optimization problems by means of barrier algorithms (Q1979175) (← links)
- A new nonmonotone adaptive trust region line search method for unconstrained optimization (Q1980974) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems (Q1986109) (← links)
- Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations (Q1986155) (← links)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems (Q1991255) (← links)
- Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations (Q1993026) (← links)
- A new modified BFGS method for unconstrained optimization problems (Q1993498) (← links)
- An active-set algorithm and a trust-region approach in constrained minimax problem (Q1993563) (← links)
- Computing the matrix sine and cosine simultaneously with a reduced number of products (Q1995962) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A deterministic method for continuous global optimization using a dense curve (Q1998159) (← links)
- A new nonmonotone line-search trust-region approach for nonlinear systems (Q2001862) (← links)
- On two new formulations for the fixed charge network design problem with shortest path constraints (Q2003438) (← links)
- A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems (Q2004127) (← links)
- A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems (Q2004132) (← links)
- A Cauchy point direction trust region algorithm for nonlinear equations (Q2007093) (← links)
- Convergence analysis of an improved BFGS method and its application in the Muskingum model (Q2007100) (← links)
- A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems (Q2007335) (← links)
- Boosting the computation of the matrix exponential (Q2007672) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length (Q2009059) (← links)
