On local search in d.c. optimization problems
type: Item
instance of: scholarly article
title: On local search in d.c. optimization problems
zbMATH Open document ID: 1338.90327
author: A. S. Strekalovskiĭ
published in: Applied Mathematics and Computation
publication date: 2016-06-22T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6596617
zbMATH Keywords: difference of two convex functions
zbMATH Keywords: local search
zbMATH Keywords: linearized problems
zbMATH Keywords: critical points
MaRDI profile type: Publication
full work available at URL: j.amc.2014.08.092
OpenAlex ID: W2038422024
cites work: Q4889854
cites work: Handbook of global optimization
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Convex analysis and global optimization
cites work: On the convergence of Newton iterations to non-stationary points
cites work: The BFGS method with exact line searches fails for non-convex objective functions
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Q4464637
cites work: Q3141900
cites work: Q3720308
cites work: Q5491447
cites work: Q5693853
cites work: Iterative Solution of Nonlinear Optimal Control Problems
cites work: The Validity of a Family of Optimization Methods
cites work: Local search in problems with nonconvex constraints
cites work: Q3857636
cites work: On computational search for optimistic solutions in bilevel problems
cites work: Global optimality conditions for nonconvex optimization
cites work: Sign reversion approach to concave minimization problems
cites work: On a decomposition method for nonconvex global optimization
cites work: On duality bound methods for nonconvex global optimization
cites work: On solving nonconvex optimization problems by reducing the duality gap
cites work: The use of grossone in mathematical programming and operations research
cites work: On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
cites work: The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
DOI: 10.1016/J.AMC.2014.08.092
Recommended article: On a global search in D.C. optimization problems
Recommended article: Global and local search methods for D.C. constrained problems
Recommended article: A local search method for optimization problem with d.c. inequality constraints
Recommended article: Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
Recommended article: On d.c. optimization problems
Recommended article: Q3441216
Recommended article: Q4339078
Recommended article: Local search in problems with nonconvex constraints
Recommended article: Q3059322
description: scientific article; zbMATH DE number 6596617