Multi-start approach for an integer determinant maximization problem

DOI10.1080/02331934.2011.568617zbMath1270.90044OpenAlexW2162816032MaRDI QIDQ4916310

Renata Sotirov, Tamás Terlaky

Publication date: 22 April 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.568617

zbMATH Keywords

trust-region algorithmconic optimizationdeterminant maximizationmulti-start framework

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90)

Uses Software

• YALMIP

Cites Work

• Solving semidefinite-quadratic-linear programs using SDPT3
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• The maximal \(\{-1,1\}\)-determinant of order 15
• Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design
• A new adaptive multi-start technique for combinatorial global optimizations
• An attractor-repeller approach to floorplanning
• Greedy randomized adaptive search procedures
• Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
• Maximizing the determinant for a special class of block-partitioned matrices
• Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
• A primal–dual interior point method for nonlinear optimization over second-order cones
• Matrix Analysis
• Determinant Maximization with Linear Matrix Inequality Constraints
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• PENNON: A code for convex nonlinear and semidefinite programming