Two-phase generalized reduced gradient method for constrained global optimization
From MaRDI portal
Publication:613033
DOI10.1155/2010/976529zbMath1206.90123OpenAlexW2169508163WikidataQ58652439 ScholiaQ58652439MaRDI QIDQ613033
Publication date: 17 December 2010
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/223845
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur la convergence théorique de la méthode du gradient reduit généralise
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem
- A variant of the generalized reduced gradient algorithm for non-linear programming and its applications
- Global optimization by controlled random search
- The largest small hexagon
- Generalized reduced gradient method as an extension of feasible direction methods
- Global optimization by random perturbation of the gradient method with a fixed parameter
- The largest small octagon
- A variant of SQP method for inequality constrained optimization and its global convergence
- Stopping Rules for a Random Optimization Method
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Efficiently Converging Minimization Methods Based on the Reduced Gradient
- A bilinear approach to the pooling problem†
- Optimal random perturbations for stochastic approximation using a simultaneous perturbation gradient approximation
- A Reduced Gradient Algorithm for Nonlinear Network Problems