Local search in problems with nonconvex constraints

DOI10.1134/S0965542507030049zbMath1210.90134MaRDI QIDQ5311030

Alexander S. Strekalovsky, Tatiana V. Gruzdeva

Publication date: 15 October 2007

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

critical pointlocal searchlinearized problemlevel surfacedifference of two convex functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (9)

On local search in d.c. optimization problems ⋮ On numerical solving the spherical separability problem ⋮ On a continuous approach for the maximum weighted clique problem ⋮ On solving the sum-of-ratios problem ⋮ On computational search for optimistic solutions in bilevel problems ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ Fractional programming approach to a cost minimization problem in electricity market

This page was built for publication: Local search in problems with nonconvex constraints