On local search in d.c. optimization problems

DOI10.1016/J.AMC.2014.08.092zbMath1338.90327OpenAlexW2038422024MaRDI QIDQ299416

Alexander S. Strekalovsky

Publication date: 22 June 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.08.092

zbMATH Keywords

critical pointslocal searchdifference of two convex functionslinearized problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (26)

Local search in quadratic two-person game ⋮ On numerical solving the spherical separability problem ⋮ Global optimality conditions in nonconvex optimization ⋮ Clusterwise support vector linear regression ⋮ Global optimality conditions and exact penalization ⋮ On solving the sum-of-ratios problem ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Semi-supervised \(k\)-means clustering via DC programming approach ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ DC programming algorithm for clusterwise linear \(L_1\) regression ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering ⋮ Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints ⋮ On Search for All Roots of a System of Quadratic Equations ⋮ An inertial algorithm for DC programming ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Fractional programming approach to a cost minimization problem in electricity market ⋮ Convex maximization formulation of general sphere packing problem ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ A local search scheme for the inequality-constrained optimal control problem ⋮ On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game ⋮ K-means clustering via a nonconvex optimization approach ⋮ On the solution of convex bilevel optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The use of grossone in mathematical programming and operations research
• On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
• Sign reversion approach to concave minimization problems
• On duality bound methods for nonconvex global optimization
• The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
• Global optimality conditions for nonconvex optimization
• Handbook of global optimization
• The BFGS method with exact line searches fails for non-convex objective functions
• On the convergence of Newton iterations to non-stationary points
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• On computational search for optimistic solutions in bilevel problems
• On a decomposition method for nonconvex global optimization
• On solving nonconvex optimization problems by reducing the duality gap
• Local search in problems with nonconvex constraints
• The Validity of a Family of Optimization Methods
• Iterative Solution of Nonlinear Optimal Control Problems
• Convex analysis and global optimization

This page was built for publication: On local search in d.c. optimization problems