Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems
From MaRDI portal
Publication:505738
DOI10.1016/j.amc.2013.10.024zbMath1354.65118OpenAlexW2063238891MaRDI QIDQ505738
Eduardo Souza de Cursi, Abdelkrim El Mouatasim, Rachid Ellaia
Publication date: 26 January 2017
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.10.024
nonconvex programmingnumerical computationstochastic perturbationconstraints optimizationreduced gradient and GRG methods
Related Items (4)
Stochastic perturbation of subgradient algorithm for nonconvex deep neural networks ⋮ Unnamed Item ⋮ Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Bayes admissible estimation of the means in Poisson decomposable graphical models
- A variant of the generalized reduced gradient algorithm for non-linear programming and its applications
- Global optimization by controlled random search
- Minimax estimation of a constrained Poisson vector
- 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
- Minimax estimation of a bounded parameter of a discrete distribution
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
- The gradient projection method for solving an optimal control problem
- A generalized gradient method for optimal control problems with inequality constraints and singular arcs
- 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
- Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation
- A bilinear approach to the pooling problem†
- Optimal random perturbations for stochastic approximation using a simultaneous perturbation gradient approximation
This page was built for publication: Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems
