Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints

DOI10.2478/v10006-011-0024-zzbMath1271.49022OpenAlexW1990787369MaRDI QIDQ2845108

Abdelkrim El Mouatasim, Rachid Ellaia, Eduardo Souza de Cursi

Publication date: 22 August 2013

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10006-011-0024-z

zbMATH Keywords

global optimizationnonsmooth optimizationlinear constraintsvariable metric methodstochastic perturbation

Mathematics Subject Classification ID

Related Items (4)

Stochastic perturbation of subgradient algorithm for nonconvex deep neural networks ⋮ Unnamed Item ⋮ Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems ⋮ Genetic and combinatorial algorithms for optimal sizing and placement of active power filters

Uses Software

• Global Optimization Toolbox For Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A filter-variable-metric method for nonsmooth convex constrained optimization
• Generalized pattern search methods for a class of nonsmooth optimization problems with structure
• A note on ``A continuous approach to nonlinear integer programming
• Conditional subgradient optimization -- theory and applications
• New variable-metric algorithms for nondifferentiable optimization problems
• Convergence of some algorithms for convex minimization
• Global optimization by random perturbation of the gradient method with a fixed parameter
• Methods of descent for nondifferentiable optimization
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• The Cutting-Plane Method for Solving Convex Programs
• Stopping Rules for a Random Optimization Method
• Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
• An active set method for solving linearly constrained nonsmooth optimization problems
• Variable Metric Method for Minimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• A Rapidly Convergent Descent Method for Minimization
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Conditioning of Quasi-Newton Methods for Function Minimization

This page was built for publication: Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints