Cited in
(57)- Benchmarking optimization software with performance profiles.
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- Methods for convex and general quadratic programming
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- High-dimensional Bayesian optimization using low-dimensional feature spaces
- TACO: a toolkit for AMPL control optimization
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- A comparison of complete global optimization solvers
- Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A nonmonotone semismooth inexact Newton method
- Mesh shape-quality optimization using the inverse mean-ratio metric
- A primal-dual modified log-barrier method for inequality constrained nonlinear optimization
- A feasible method for optimization with orthogonality constraints
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- LIBOPT
- testenv
- QPA
- COCONUT
- MINPACK-2
- OPALQP
- nlpy
- OPAL
- OPTMODEL
- MathOptimizer
- HQP
- PyEvalGui
- FrontLine
- LUMOD
- MinFinder
- Algorithm 709
- CYCLADES
- Solving mathematical programs with complementarity constraints as nonlinear programs
- JuMP: a modeling language for mathematical optimization
- Nonlinear (local) optimization. The state of the art
- The optimization test environment
- Optimization Test Environment
- DrAmpl: A meta solver for optimization problem analysis
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- A trust-region algorithm for global optimization
- dfppm
- A shifted primal-dual penalty-barrier method for nonlinear optimization
- Supporting global numerical optimization of rational functions by generic symbolic convexity tests
- QPDO
- An algorithm for the fast solution of symmetric linear complementarity problems
- Study of a primal-dual algorithm for equality constrained minimization
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
- Best practices for comparing optimization algorithms
- Benchmarking nonlinear optimization software in technical computing environments
- Stopping rules and backward error analysis for bound-constrained optimization
- Estimating Computational Noise
- A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
- Extremal problems for convex polygons
This page was built for software: COPS
