Self-concordance is NP-hard

  title={Self-concordance is NP-hard},
  author={Lek-Heng Lim},
  journal={Journal of Global Optimization},
  • Lek-Heng Lim
  • Published 29 March 2013
  • Economics
  • Journal of Global Optimization
We show that deciding whether a convex function is self-concordant is in general an intractable problem. 

Certifying Polynomial Nonnegativity via Hyperbolic Optimization

  • J. Saunderson
  • Mathematics, Computer Science
    SIAM J. Appl. Algebra Geom.
  • 2019
We describe a new approach to certifying the global nonnegativity of multivariate polynomials by solving hyperbolic optimization problems---a class of convex optimization problems that generalize

Rank-constrained Hyperbolic Programming

. We extend rank-constrained optimization to general hyperbolic programs (HP) using the notion of matroid rank. For LP and SDP respectively, this reduces to sparsity-constrained LP and

Multilinear Computing and Multilinear Algebraic Geometry

This proposal seeks to fund the research of three faculty drawn to these new computational challenges, who are also finding increasingly that their different fields of expertise all contribute to the development of dramatically more effective tools.



Nonlinear optimization: complexity issues

Optimization and convexity complexity theory convex quadratic programming non-convex quadratic programming local optimization complexity in the black-box model.

NP-hardness of deciding convexity of quartic polynomials and related problems

It is shown that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomials of degree four (or higher even degree) is globally convex, and it is proved that deciding strict convexity, strong conveXity, quasiconvexality, and pseudoconvexity of polynmials of even degree four or higher is strongly NP-hard.

On Norm Attaining Polynomials

We show that for every Banach space X the set of 2-homogeneous continuous polynomials whose canonical extension to X∗∗ attain their norm is a dense subset of the space of all 2-homogeneous continuous

Maxima for Graphs and a New Proof of a Theorem of Turán

Maximum of a square-free quadratic form on a simplex. The following question was suggested by a problem of J. E. MacDonald Jr. (1): Given a graph G with vertices 1, 2, . . . , n. Let S be the simplex

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a

Most Tensor Problems Are NP-Hard

It is proved that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard and how computing the combinatorial hyperdeterminant is NP-, #P-, and VNP-hard.

Computational Complexity

  • S. Vadhan
  • Computer Science, Mathematics
    Encyclopedia of Cryptography and Security
  • 2005
Computational complexity theory provides a foundation for most of modern cryptography, where the aim is to design cryptosystems that are “easy to use” but “hard to break”.

Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems

It is proved that for any given d ≥ 3 and p ∈ [2, ∞], both the problem of optimizing a degree-d homogeneous polynomial over the Lp-ball and the problemof optimizing adegree-d multilinear form (regardless of its super-symmetry) over L p-balls are NP-hard.

Convex Optimization

A comprehensive introduction to the subject of convex optimization shows in detail how such problems can be solved numerically with great efficiency.

Postscript about NP-hard problems

People have convinced me that I should use reducibility in Cook's sense as opposed to Karp's in the definition of NP-hard, and I think I have found a decent way to avoid the dile~mna between Cook's "Turing reducibilities" and Karp’s "many-one reducibles".