Pages that link to "Item:Q3221769"

The following pages link to CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769):

Displaying 40 items.

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