IDEAS home Printed from https://ideas.repec.org/f/pde419.html
   My authors  Follow this author

Etienne de Klerk

Personal Details

First Name:Etienne
Middle Name:
Last Name:de Klerk
Suffix:
RePEc Short-ID:pde419
[This author has chosen not to make the email address public]

Affiliation

CentER Graduate School for Economics and Business
School of Economics and Management
Universiteit van Tilburg

Tilburg, Netherlands
https://www.tilburguniversity.edu/research/economics-and-management/graduate-school
RePEc:edi:cekubnl (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Discussion Paper 2009-54, Tilburg University, Center for Economic Research.
  2. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Discussion Paper 2008-96, Tilburg University, Center for Economic Research.
  3. Bai, Y.Q. & de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "Exploiting Group Symmetry in Truss Topology Optimization," Discussion Paper 2007-17, Tilburg University, Center for Economic Research.
  4. de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Discussion Paper 2007-44, Tilburg University, Center for Economic Research.
  5. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Discussion Paper 2007-101, Tilburg University, Center for Economic Research.
  6. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Discussion Paper 2007-20, Tilburg University, Center for Economic Research.
  7. de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Discussion Paper 2006-85, Tilburg University, Center for Economic Research.
  8. de Klerk, E. & Newman, M.W. & Pasechnik, D.V. & Sotirov, R., 2006. "On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs," Discussion Paper 2006-93, Tilburg University, Center for Economic Research.
  9. de Klerk, E. & Elfadul, G.E.E. & den Hertog, D., 2006. "Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming," Discussion Paper 2006-26, Tilburg University, Center for Economic Research.
  10. de Klerk, E. & den Hertog, D. & Elfadul, G.E.E., 2005. "On the Complexity of Optimization over the Standard Simplex," Discussion Paper 2005-125, Tilburg University, Center for Economic Research.
  11. de Klerk, E. & Pasechnik, D.V., 2005. "Solving SDP's in Non-commutative Algebras Part I : The Dual-Scaling Algorithm," Discussion Paper 2005-17, Tilburg University, Center for Economic Research.
  12. de Klerk, E. & Pasechnik, D.V., 2005. "A Linear Programming Reformulation of the Standard Quadratic Optimization Problem," Discussion Paper 2005-24, Tilburg University, Center for Economic Research.
  13. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Discussion Paper 2005-73, Tilburg University, Center for Economic Research.
  14. de Klerk, E. & Pasechnik, D.V., 2005. "A Note on the Stability Number of an Orthogonality Graph," Discussion Paper 2005-66, Tilburg University, Center for Economic Research.
  15. den Hertog, D. & de Klerk, E. & Roos, J., 2000. "On Convex Quadratic Approximation," Discussion Paper 2000-47, Tilburg University, Center for Economic Research.

Articles

  1. de Klerk, Etienne & Pasechnik, Dmitrii V., 2004. "Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms," European Journal of Operational Research, Elsevier, vol. 157(1), pages 39-45, August.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Discussion Paper 2008-96, Tilburg University, Center for Economic Research.

    Cited by:

    1. Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    2. Klerk, Etienne de, 2010. "Exploiting special structure in semidefinite programming: A survey of theory and applications," European Journal of Operational Research, Elsevier, vol. 201(1), pages 1-10, February.
    3. Sungwoo Park & Dianne P. O’Leary, 2015. "A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 558-571, August.
    4. Vivek Bagaria & Jian Ding & David Tse & Yihong Wu & Jiaming Xu, 2020. "Hidden Hamiltonian Cycle Recovery via Linear Programming," Operations Research, INFORMS, vol. 68(1), pages 53-70, January.
    5. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Other publications TiSEM 3b5033a4-98bc-4969-aa57-d, Tilburg University, School of Economics and Management.
    6. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Discussion Paper 2009-54, Tilburg University, Center for Economic Research.

  2. Bai, Y.Q. & de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "Exploiting Group Symmetry in Truss Topology Optimization," Discussion Paper 2007-17, Tilburg University, Center for Economic Research.

    Cited by:

    1. Miguel Carrasco & Benjamin Ivorra & Angel Manuel Ramos, 2012. "A Variance-Expected Compliance Model for Structural Optimization," Journal of Optimization Theory and Applications, Springer, vol. 152(1), pages 136-151, January.
    2. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Other publications TiSEM 9fef820b-69d2-43f2-a501-e, Tilburg University, School of Economics and Management.

  3. de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Discussion Paper 2007-44, Tilburg University, Center for Economic Research.

    Cited by:

    1. Hu, Hao & Sotirov, Renata & Wolkowicz, Henry, 2023. "Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs," Other publications TiSEM 8dd3dbae-58fd-4238-b786-e, Tilburg University, School of Economics and Management.
    2. Brosch, Daniel & de Klerk, Etienne, 2021. "Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software," Other publications TiSEM 283da78a-b42f-47b4-b2b7-2, Tilburg University, School of Economics and Management.
    3. Matteo Fischetti & Michele Monaci & Domenico Salvagnin, 2012. "Three Ideas for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 60(4), pages 954-964, August.
    4. Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.
    5. José F. S. Bravo Ferreira & Yuehaw Khoo & Amit Singer, 2018. "Semidefinite programming approach for the quadratic assignment problem with a sparse graph," Computational Optimization and Applications, Springer, vol. 69(3), pages 677-712, April.
    6. Samuel Burer & Sunyoung Kim & Masakazu Kojima, 2014. "Faster, but weaker, relaxations for quadratically constrained quadratic programs," Computational Optimization and Applications, Springer, vol. 59(1), pages 27-45, October.
    7. Xiaolong Kuang & Bissan Ghaddar & Joe Naoum-Sawaya & Luis F. Zuluaga, 2019. "Alternative SDP and SOCP approximations for polynomial optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 153-175, June.
    8. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Discussion Paper 2008-96, Tilburg University, Center for Economic Research.
    9. Feizollahi, Mohammad Javad & Feyzollahi, Hadi, 2015. "Robust quadratic assignment problem with budgeted uncertain flows," Operations Research Perspectives, Elsevier, vol. 2(C), pages 114-123.
    10. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Discussion Paper 2007-101, Tilburg University, Center for Economic Research.
    11. Samuel Burer & Kyungchan Park, 2024. "A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 320-339, July.
    12. van Dam, E.R. & Sotirov, R., 2015. "On bounding the bandwidth of graphs with symmetry," Other publications TiSEM 180849f1-e7d3-44d9-8424-5, Tilburg University, School of Economics and Management.
    13. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Other publications TiSEM 9fef820b-69d2-43f2-a501-e, Tilburg University, School of Economics and Management.
    14. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.
    15. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
    16. Jiming Peng & Tao Zhu & Hezhi Luo & Kim-Chuan Toh, 2015. "Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting," Computational Optimization and Applications, Springer, vol. 60(1), pages 171-198, January.

  4. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Discussion Paper 2007-20, Tilburg University, Center for Economic Research.

    Cited by:

    1. Thorsten Koch & Ted Ralphs & Yuji Shinano, 2012. "Could we use a million cores to solve an integer program?," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(1), pages 67-93, August.
    2. de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Discussion Paper 2007-44, Tilburg University, Center for Economic Research.

  5. de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Discussion Paper 2006-85, Tilburg University, Center for Economic Research.

    Cited by:

    1. W. Ackooij & A. Frangioni & W. Oliveira, 2016. "Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support," Computational Optimization and Applications, Springer, vol. 65(3), pages 637-669, December.
    2. M. Locatelli, 2009. "Complexity Results for Some Global Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(1), pages 93-102, January.
    3. Immanuel Bomze & Stefan Gollowitzer & E. Yıldırım, 2014. "Rounding on the standard simplex: regular grids for global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 243-258, July.
    4. Marco Locatelli, 2013. "Approximation algorithm for a class of global optimization problems," Journal of Global Optimization, Springer, vol. 55(1), pages 13-25, January.
    5. Peter Dickinson & Luuk Gijben, 2014. "On the computational complexity of membership problems for the completely positive cone and its dual," Computational Optimization and Applications, Springer, vol. 57(2), pages 403-415, March.
    6. Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2020. "An active-set algorithmic framework for non-convex optimization problems over the simplex," Computational Optimization and Applications, Springer, vol. 77(1), pages 57-89, September.
    7. Maziar Salahi, 2010. "Convex optimization approach to a single quadratically constrained quadratic minimization problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(2), pages 181-187, June.

  6. de Klerk, E. & Newman, M.W. & Pasechnik, D.V. & Sotirov, R., 2006. "On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs," Discussion Paper 2006-93, Tilburg University, Center for Economic Research.

    Cited by:

    1. Brosch, Daniel & de Klerk, Etienne, 2021. "Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software," Other publications TiSEM 283da78a-b42f-47b4-b2b7-2, Tilburg University, School of Economics and Management.

  7. de Klerk, E. & Elfadul, G.E.E. & den Hertog, D., 2006. "Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming," Discussion Paper 2006-26, Tilburg University, Center for Economic Research.

    Cited by:

    1. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Other publications TiSEM 9b41ff5e-2808-4d12-a58c-0, Tilburg University, School of Economics and Management.
    2. de Klerk, E. & den Hertog, D. & Elfadul, G.E.E., 2005. "On the Complexity of Optimization over the Standard Simplex," Discussion Paper 2005-125, Tilburg University, Center for Economic Research.
    3. Hayato Waki & Maho Nakata & Masakazu Muramatsu, 2012. "Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization," Computational Optimization and Applications, Springer, vol. 53(3), pages 823-844, December.
    4. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Other publications TiSEM 9fef820b-69d2-43f2-a501-e, Tilburg University, School of Economics and Management.
    5. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Discussion Paper 2007-20, Tilburg University, Center for Economic Research.

  8. de Klerk, E. & den Hertog, D. & Elfadul, G.E.E., 2005. "On the Complexity of Optimization over the Standard Simplex," Discussion Paper 2005-125, Tilburg University, Center for Economic Research.

    Cited by:

    1. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    2. Immanuel Bomze & Stefan Gollowitzer & E. Yıldırım, 2014. "Rounding on the standard simplex: regular grids for global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 243-258, July.
    3. Titi, Jihad & Garloff, Jürgen, 2017. "Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 246-258.
    4. Tareq Hamadneh & Hassan Al-Zoubi & Saleh Ali Alomari, 2020. "Fast Computation of Polynomial Data Points Over Simplicial Face Values," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 19(01), pages 1-13, March.
    5. Sadek, Lakhlifa & Bataineh, Ahmad Sami & Isik, Osman Rasit & Alaoui, Hamad Talibi & Hashim, Ishak, 2023. "A numerical approach based on Bernstein collocation method: Application to differential Lyapunov and Sylvester matrix equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 212(C), pages 475-488.

  9. de Klerk, E. & Pasechnik, D.V., 2005. "A Linear Programming Reformulation of the Standard Quadratic Optimization Problem," Discussion Paper 2005-24, Tilburg University, Center for Economic Research.

    Cited by:

    1. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
    2. Xiaolong Kuang & Luis F. Zuluaga, 2018. "Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization," Journal of Global Optimization, Springer, vol. 70(3), pages 551-577, March.
    3. Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.

  10. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Discussion Paper 2005-73, Tilburg University, Center for Economic Research.

    Cited by:

    1. Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2005. "Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing," Other publications TiSEM ad31ef2c-fc29-46c1-9b8f-6, Tilburg University, School of Economics and Management.
    2. Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2005. "Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing," Discussion Paper 2005-132, Tilburg University, Center for Economic Research.
    3. Stinstra, E., 2006. "The meta-model approach for simulation-based design optimization," Other publications TiSEM 713f828a-4716-4a19-af00-e, Tilburg University, School of Economics and Management.
    4. Siem, A.Y.D., 2008. "Property preservation and quality measures in meta-models," Other publications TiSEM 259d3ed2-1a23-48fe-8af8-2, Tilburg University, School of Economics and Management.
    5. Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2007. "A Method For Approximating Univariate Convex Functions Using Only Function Value Evaluations," Other publications TiSEM a3afe119-3957-4700-a895-4, Tilburg University, School of Economics and Management.
    6. Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2007. "A Method For Approximating Univariate Convex Functions Using Only Function Value Evaluations," Discussion Paper 2007-67, Tilburg University, Center for Economic Research.

  11. de Klerk, E. & Pasechnik, D.V., 2005. "A Note on the Stability Number of an Orthogonality Graph," Discussion Paper 2005-66, Tilburg University, Center for Economic Research.

    Cited by:

    1. de Klerk, E. & Pasechnik, D.V., 2005. "Solving SDP's in Non-commutative Algebras Part I : The Dual-Scaling Algorithm," Other publications TiSEM 6f3b3773-18cc-400b-961d-6, Tilburg University, School of Economics and Management.
    2. de Klerk, E. & Pasechnik, D.V., 2005. "Solving SDP's in Non-commutative Algebras Part I : The Dual-Scaling Algorithm," Discussion Paper 2005-17, Tilburg University, Center for Economic Research.

  12. den Hertog, D. & de Klerk, E. & Roos, J., 2000. "On Convex Quadratic Approximation," Discussion Paper 2000-47, Tilburg University, Center for Economic Research.

    Cited by:

    1. Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2005. "Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing," Other publications TiSEM ad31ef2c-fc29-46c1-9b8f-6, Tilburg University, School of Economics and Management.
    2. Siem, A.Y.D. & den Hertog, D. & Hoffmann, A.L., 2005. "Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing," Discussion Paper 2005-132, Tilburg University, Center for Economic Research.
    3. Stinstra, Erwin & den Hertog, Dick, 2008. "Robust optimization using computer experiments," European Journal of Operational Research, Elsevier, vol. 191(3), pages 816-837, December.
    4. Zhichao Zheng & Karthik Natarajan & Chung-Piaw Teo, 2016. "Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty," Operations Research, INFORMS, vol. 64(6), pages 1406-1421, December.
    5. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Discussion Paper 2005-73, Tilburg University, Center for Economic Research.
    6. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Other publications TiSEM 43a1152a-8130-4e42-851b-e, Tilburg University, School of Economics and Management.

Articles

  1. de Klerk, Etienne & Pasechnik, Dmitrii V., 2004. "Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms," European Journal of Operational Research, Elsevier, vol. 157(1), pages 39-45, August.

    Cited by:

    1. Jibetean, D. & de Klerk, E., 2006. "Global optimization of rational functions : A semidefinite programming approach," Other publications TiSEM 25febbc3-cd0c-4eb7-9d37-d, Tilburg University, School of Economics and Management.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Etienne de Klerk should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.