Two-phase generalized reduced gradient method for constrained global optimization
Summary: The random perturbation of generalized reduced gradient method for optimization under nonlinear differentiable constraints is proposed. Generally speaking, a particular iteration of this method proceeds in two phases. In the restoration phase, feasibility is restored by means of the resolution of an auxiliary nonlinear problem, a generally nonlinear system of equations. In the optimization phase, optimality is improved by means of the consideration of the objective function, on the tangent subspace to the constraints. In this paper, optimal assumptions are stated on the restoration phase and the optimization phase that establish the global convergence of the algorithm. Some numerical examples are also given by mixture problem and octagon problem.
- Two-phase model algorithm with global convergence for nonlinear programming
- Periodically preconditioned conjugate gradient-restoration algorithm
- Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems
- scientific article; zbMATH DE number 1263980
- Global optimization by random perturbation of the gradient method with a fixed parameter
- A bilinear approach to the pooling problem†
- A Reduced Gradient Algorithm for Nonlinear Network Problems
- A variant of SQP method for inequality constrained optimization and its global convergence
- A variant of the generalized reduced gradient algorithm for non-linear programming and its applications
- Efficiently Converging Minimization Methods Based on the Reduced Gradient
- Generalized reduced gradient method as an extension of feasible direction methods
- Global optimization by controlled random search
- Global optimization by random perturbation of the gradient method with a fixed parameter
- Global optimization of generalized linear fractional programming with nonlinear constraints
- scientific article; zbMATH DE number 5703861 (Why is no real title available?)
- scientific article; zbMATH DE number 2068079 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Optimal random perturbations for stochastic approximation using a simultaneous perturbation gradient approximation
- Random perturbation of the variable metric method for unconstrained nonsmooth nonconvex optimization
- Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem
- Stochastic perturbation methods for affine restrictions.
- Stopping Rules for a Random Optimization Method
- Sur la convergence théorique de la méthode du gradient reduit généralise
- The largest small hexagon
- The largest small octagon
This page was built for publication: Two-phase generalized reduced gradient method for constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613033)
