CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- scientific article; zbMATH DE number 3395658 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Large-scale linearly constrained optimization
- Nonlinear programming codes. Information, tests, performance
- Pivot selection methods of the Devex LP code
- Reinversion with the preassigned pivot procedure
- Scaling nonlinear programs
- Solving staircase linear programs by the simplex method, 1: Inversion
Cited in
(42)- Optimal Design of Experiments for Implicit Models
- Euler discretization and inexact restoration for optimal control
- On simulation and optimization of macroeconometric models
- QPLIB: a library of quadratic programming instances
- Optimal exact design of double acceptance sampling plans by attributes
- A projected Newton method for minimization problems with nonlinear inequality constraints
- The optimization test environment
- A note on solving DiDi's driver-order matching problem
- Combined Newton-gradient method for constrained root-finding in chemical reaction networks
- A superlinearly convergent constrained min-max algorithm for rival models of the same system
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
- Optimization with staircase structure: An application to generation scheduling
- Adaptive grid semidefinite programming for finding optimal designs
- Optimal designs for dose-escalation trials and individual allocations in cohorts
- A novel hybrid algorithm for scheduling steel-making continuous casting production
- Solving Large Sparse Nonlinear Programs Using GRG
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Portfolio performance measurement using differential evolution
- Computing Wardropian equilibria in a complementarity framework
- Optimal Design of Acceptance Sampling Plans by Variables for Nonconforming Proportions When the Standard Deviation Is Unknown
- On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems
- Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem
- Solving quality control problems with an algorithm for minimax programs with coupled constraints
- Global optimization of rational functions: a semidefinite programming approach
- Algorithm 813
- Efficiency based decision rules for production planning and control
- Efficiency based production planning and control models
- Optimal experimental design for linear time invariant state-space models
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Optimal design of multivariate acceptance sampling plans by variables
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Planning for HIV screening, testing, and care at the veterans health administration
- The complex interior-boundary method for linear and nonlinear programming with linear constraints
- Optimal exact designs of experiments via mixed integer nonlinear programming
- A feasible directions method for computing Bayes E-optimal block designs
- Discrete-time optimal control of an economic system using different objective functions
- Runge-Kutta based procedure for the optimal control of differential-algebraic equations
- scientific article; zbMATH DE number 13594 (Why is no real title available?)
- Steering exact penalty methods for nonlinear programming
- Structured regularization for barrier NLP solvers
- Local convergence of an inexact-restoration method and numerical experiments
This page was built for publication: CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221769)
