A Gradient Sampling Method Based on Ideal Direction for Solving Nonsmooth Optimization Problems.

Morteza Maleknia Mostafa Shamsi

Published in: J. Optim. Theory Appl. (2020)

Keyphrases

optimization problems
combinatorial optimization
nonlinear programming
gradient direction
evolutionary algorithm
continuous optimization problems
metaheuristic

cost function
constrained problems
traveling salesman problem
objective function
subgradient method
discrete optimization problems

mathematical programming
edge detection
variational inequalities
constrained optimization problems
exact penalty
multiscale

solving problems
gradient information
knapsack problem
convex optimization problems
bilevel programming
sensitivity analysis