On solving optimization problems with hidden nonconvex structures

DOI10.1007/978-1-4939-0808-0_23MaRDI QIDQ2949927zbMATH OpenOpenAlexFDO

Authors A. S. Strekalovskiĭ

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

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

Recommendations

• On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
• On computational search for optimistic solutions in bilevel problems
• The complementary convex structure in global optimization
• Global optimisation of pessimistic bi-level problems
• Connection of some bilevel and nonlinear optimization problems

Cited in

(29)

• On active-set methods for quadratic problems with positive semidefinite matrices
• D. C. optimization approach for finding Berge equilibrium in bimatrix game
• On solving the sum-of-ratios problem
• On the problem polyhedral separability: a numerical solution
• On global search in nonconvex optimal control problems
• Triangles of conflicts and hexamatrix games
• On numerical solving the spherical separability problem
• The complementary convex structure in global optimization
• 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
• Global optimality conditions for DC-constrained optimal control problems
• The structured H₂-optimization problem
• A survey of hidden convex optimization
• Semi-supervised \(k\)-means clustering via DC programming approach
• A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
• Adaptive nested optimization scheme for multidimensional global search
• K-means clustering via a nonconvex optimization approach
• Minimizing sequences in a constrained DC optimization problem
• One way to solve pessimistic bilevel optimization problems
• On solvability recognition for interval linear systems of equations
• On computational search for Nash equilibrium in hexamatrix games
• On a solving bilevel d.c.-convex optimization problems
• Fractional programming approach to a cost minimization problem in electricity market
• A local search method for optimization problem with d.c. inequality constraints
• Global optimality conditions and exact penalization
• Global optimality conditions in nonconvex optimization
• Global search for bilevel optimization with quadratic data
• Hybrid global search algorithm with genetic blocks for solving hexamatrix games
• D.C. programming approach for solving an applied ore-processing problem

This page was built for publication: On solving optimization problems with hidden nonconvex structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949927)