CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems

DOI10.1007/BF02591747zbMath0557.90088MaRDI QIDQ3221769

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

optimization Computational experience CONOPT sparse-matrix algorithms static and dynamic large-scale nonlinearly constrained static and dynamic large-scale nonlinearly constrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Related Items

Optimal Design of Experiments for Implicit Models, Optimal design of multivariate acceptance sampling plans by variables, Planning for HIV Screening, Testing, and Care at the Veterans Health Administration, A projected Newton method for minimization problems with nonlinear inequality constraints, Portfolio performance measurement using differential evolution, Efficiency based decision rules for production planning and control, Local convergence of an inexact-restoration method and numerical experiments, Solving quality control problems with an algorithm for minimax programs with coupled constraints, An algorithm based on semidefinite programming for finding minimax optimal designs, A superlinearly convergent constrained min-max algorithm for rival models of the same system, On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems, Optimal exact design of double acceptance sampling plans by attributes, Combined Newton-gradient method for constrained root-finding in chemical reaction networks, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Adaptive grid semidefinite programming for finding optimal designs, Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem, Steering exact penalty methods for nonlinear programming, Euler discretization and inexact restoration for optimal control, On simulation and optimization of macroeconometric models, Structured regularization for barrier NLP solvers, A note on solving DiDi's driver-order matching problem, Discrete-time optimal control of an economic system using different objective functions, A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination, Optimal Design of Acceptance Sampling Plans by Variables for Nonconforming Proportions When the Standard Deviation Is Unknown, Global optimization of rational functions: a semidefinite programming approach, Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods, The complex interior-boundary method for linear and nonlinear programming with linear constraints, Unnamed Item, QPLIB: a library of quadratic programming instances, A novel hybrid algorithm for scheduling steel-making continuous casting production, Computing Wardropian equilibria in a complementarity framework, Efficiency based production planning and control models, Optimization with staircase structure: An application to generation scheduling, Optimal exact designs of experiments via mixed integer nonlinear programming, Runge-Kutta based procedure for the optimal control of differential-algebraic equations, Optimal experimental design for linear time invariant state-space models, Optimal designs for dose-escalation trials and individual allocations in cohorts, A feasible directions method for computing Bayes E-optimal block designs, A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models, The optimization test environment

Uses Software

Cites Work