CONOPT
CONOPT is a generalized reduced-gradient (GRG) algorithm for solving large-scale nonlinear programs involving sparse nonlinear constraints. The paper will discuss strategic and tactical decisions in the development, upgrade, and maintenance of CONOPT over the last 8 years. A verbal and intuitive comparison of the GRG algorithm with the popular methods based on sequential linearized subproblems forms the basis for discussions of the implementation of critical components in a GRG code: basis factorizations, search directions, line-searches, and Newton iterations. The paper contains performance statistics for a range of models from different branches of engineering and economics of up to 4000 equations with comparative figures for MINOS version 5.3. Based on these statistics the paper concludes that GRG codes can be very competitive with other codes for large-scale nonlinear programming from both an efficiency and a reliability point of view. This is especially true for models with fairly nonlinear constraints, particularly when it is difficult to attain feasibility
Keywords for this software
References in zbMATH (referenced in 140 articles , 1 standard article )
Showing results 1 to 20 of 140.
Sorted by year (- Amaya Moreno, Liana; Fügenschuh, Armin; Kaier, Anton; Schlobach, Swen: A nonlinear model for vertical free-flight trajectory planning (2018)
- Duarte, Belmiro P. M.; Sagnol, Guillaume; Wong, Weng Kee: An algorithm based on semidefinite programming for finding minimax optimal designs (2018)
- Duarte, Belmiro P. M.; Wong, Weng Kee; Dette, Holger: Adaptive grid semidefinite programming for finding optimal designs (2018)
- Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
- Pineda, S.; Bylling, H.; Morales, J. M.: Efficiently solving linear bilevel programming problems using off-the-shelf optimization software (2018)
- Post, Thierry; Karabatı, Selçuk; Arvanitis, Stelios: Portfolio optimization based on stochastic dominance and empirical likelihood (2018)
- Andrei, Neculai: Continuous nonlinear optimization for engineering applications in GAMS technology (2017)
- Bongartz, Dominik; Mitsos, Alexander: Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (2017)
- Boukouvala, Fani; Faruque Hasan, M. M.; Floudas, Christodoulos A.: Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption (2017)
- Geißler, Björn; Morsi, Antonio; Schewe, Lars; Schmidt, Martin: Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps (2017)
- Klimeš, Lubomír; Popela, Pavel; Mauder, Tomáš; Štětina, Josef; Charvát, Pavel: Two-stage stochastic programming approach to a PDE-constrained steel production problem with the moving interface. (2017)
- Lasdon, Leon; Shirzadi, Shawn; Ziegel, Eric: Implementing CRM models for improved oil recovery in large oil fields (2017)
- Leimbach, Marian; Schultes, Anselm; Baumstark, Lavinia; Giannousakis, Anastasis; Luderer, Gunnar: Solution algorithms for regional interactions in large-scale integrated assessment models of climate change (2017)
- Sioshansi, Ramteen; Conejo, Antonio J.: Optimization in engineering. Models and algorithms (2017)
- Wang, Ximing; Pardalos, Panos M.: A modified active set algorithm for transportation discrete network design bi-level problem (2017)
- Wan, Wei; Biegler, Lorenz T.: Structured regularization for barrier NLP solvers (2017)
- Araya, Ignacio; Reyes, Victor: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (2016)
- Borraz-Sánchez, Conrado; Bent, Russell; Backhaus, Scott; Hijazi, Hassan; Van Hentenryck, Pascal: Convex relaxations for gas expansion planning (2016)
- Cai, Yongyang; Sanstad, Alan H.: Model uncertainty and energy technology policy: the example of induced technical change (2016)
- Castro, Pedro M.: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (2016)