On Solving Optimization Problems with Hidden Nonconvex Structures

DOI10.1007/978-1-4939-0808-0_23zbMath1335.90075OpenAlexW216935602MaRDI QIDQ2949927

Alexander S. Strekalovsky

Publication date: 5 October 2015

Published in: Optimization in Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-0808-0_23

zbMATH Keywords

non-convex optimizationglobal optimality conditionglobal search methodologylocal search methodology

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (19)

On the problem polyhedral separability: a numerical solution ⋮ On global search in nonconvex optimal control problems ⋮ On numerical solving the spherical separability problem ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ Global optimality conditions in nonconvex optimization ⋮ Global optimality conditions and exact penalization ⋮ On solving the sum-of-ratios problem ⋮ Semi-supervised \(k\)-means clustering via DC programming approach ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ On solvability recognition for interval linear systems of equations ⋮ On computational search for Nash equilibrium in hexamatrix games ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ On a Solving Bilevel D.C.-Convex Optimization Problems ⋮ Fractional programming approach to a cost minimization problem in electricity market ⋮ Hybrid global search algorithm with genetic blocks for solving hexamatrix games ⋮ Global Search for Bilevel Optimization with Quadratic Data ⋮ A local search scheme for the inequality-constrained optimal control problem ⋮ K-means clustering via a nonconvex optimization approach

This page was built for publication: On Solving Optimization Problems with Hidden Nonconvex Structures