COPS

swMATH8461MaRDI QIDQ20470FDOQ20470

Author name not available (Why is that?)

Cited In (37)

• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
• Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests
• A globally convergent penalty-free method for optimization with equality constraints and simple bounds
• The optimization test environment
• Benchmarking nonlinear optimization software in technical computing environments
• Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation
• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
• A primal-dual modified log-barrier method for inequality constrained nonlinear optimization
• An infeasible nonmonotone SSLE algorithm for nonlinear programming
• Mesh shape-quality optimization using the inverse mean-ratio metric
• Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
• High-dimensional Bayesian optimization using low-dimensional feature spaces
• Best practices for comparing optimization algorithms
• How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
• A feasible method for optimization with orthogonality constraints
• A trust-region algorithm for global optimization
• A comparison of complete global optimization solvers
• DrAmpl: A meta solver for optimization problem analysis
• A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
• JuMP: A Modeling Language for Mathematical Optimization
• Nonlinear (local) optimization. The state of the art
• Study of a primal-dual algorithm for equality constrained minimization
• Stopping rules and backward error analysis for bound-constrained optimization
• TACO: a toolkit for AMPL control optimization
• Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
• An adaptive augmented Lagrangian method for large-scale constrained optimization
• An algorithm for the fast solution of symmetric linear complementarity problems
• A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
• Benchmarking optimization software with performance profiles.
• A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
• Methods for convex and general quadratic programming
• An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
• Solving mathematical programs with complementarity constraints as nonlinear programs
• A nonmonotone semismooth inexact Newton method
• Estimating Computational Noise
• Extremal problems for convex polygons

This page was built for software: COPS