Solving Large Sparse Nonlinear Programs Using GRG
From MaRDI portal
Recommendations
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Large sparse numerical optimization
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
- Greedy Gauss-Newton algorithms for finding sparse solutions to nonlinear underdetermined systems of equations
- Global convergence and implementation of NGTN method for solving large-scale sparse nonlinear programming problems
- scientific article; zbMATH DE number 3320828
Cited in
(20)- Path relinking and GRG for artificial neural networks
- Bector-Chandra type duality in fuzzy linear programming with exponential membership functions
- Characterization of aggregate fuzzy membership functions using Saaty's eigenvalue approach
- An empirical study of learning speed in back-propagation networks
- Successive linearization methods for large-scale nonlinear programming problems
- Modifications to the subroutine OPALQP for dealing with large problems
- Nonlinear optimization with GAMS /LGO
- Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization
- Financial planning via multi-stage stochastic optimization.
- Strategic financial risk management and operations research
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- A survey on the continuous nonlinear resource allocation problem
- The nonlinear knapsack problem - algorithms and applications
- Analyzing infeasible nonlinear programs
- Quadratic resource allocation with generalized upper bounds
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Nonlinear programming for multiperiod capacity planning in a manufacturing system
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- Asset portfolio optimization using fuzzy mathematical programming
- Adaptive memory programming for constrained global optimization
This page was built for publication: Solving Large Sparse Nonlinear Programs Using GRG
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993662)
