A survey of hidden convex optimization (Q2176821)

From MaRDI portal

Revision as of 01:28, 17 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126411969, #quickstatements; #temporary_batch_1723853789000)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A survey of hidden convex optimization	scientific article

Statements

scholarly article

0 references

A survey of hidden convex optimization (English)

0 references

0 references

Journal of the Operations Research Society of China

0 references

publication date

5 May 2020

0 references

full work available at URL

https://arxiv.org/abs/1902.10921

0 references

zbMATH Keywords

convex programming

0 references

quadratic programming

0 references

quadratic matrix programming

0 references

fractional programming

0 references

Lagrangian dual

0 references

semidefinite programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

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

0 references

Matrix <i>p</i>-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

Hidden convexity in some nonconvex quadratically constrained quadratic programming

0 references

On the convexification of nonlinear programming problems: An applications-oriented survey

0 references

Hidden convex minimization

0 references

Peeling Off a Nonconvex Cover of an Actual Convex Problem: Hidden Convexity

0 references

On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program

0 references

Zero duality gap for a class of nonconvex optimization problems

0 references

Towards strong duality in integer programming

0 references

Local saddle point and a class of convexification methods for nonconvex optimization problems

0 references

Convexification, concavification and monotonization in global optimization

0 references

Strong duality in optimization: shifted power reformulation

0 references

Computation of Minimum-Volume Covering Ellipsoids

0 references

0 references

\(NP\)-hardness of linear multiplicative programming and related problems

0 references

0 references

Programming with linear fractional functionals

0 references

Parameter-free convex equivalent and dual programs of fractional programming problems

0 references

A sequential method for a class of pseudoconcave fractional problems

0 references

Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems

0 references

Computing Optimal Locally Constrained Steps

0 references

Recent advances in trust region algorithms

0 references

Quadratically constrained least squares and quadratic problems

0 references

Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres

0 references

Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations

0 references

Theory and application of <i>p</i>-regularized subproblems for <i>p</i>>2

0 references

A survey for the quadratic assignment problem

0 references

0 references

Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem

0 references

Strong duality for a trust-region type relaxation of the quadratic assignment problem

0 references

Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

0 references

0 references

Feasibility testing for systems of real quadratic equations

0 references

The generalized trust region subproblem

0 references

On the Solution of the GPS Localization and Circle Fitting Problems

0 references

Strong duality for generalized trust region subproblem: S-lemma with interval bounds

0 references

A Survey of the S-Lemma

0 references

S-lemma with equality and its applications

0 references

Hidden conic quadratic representation of some nonconvex quadratic optimization problems

0 references

SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices

0 references

Convexity of quadratic transformations and its use in control and optimization

0 references

Parametric Lagrangian dual for the binary quadratic programming problem

0 references

Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

0 references

Semidefinite programming relaxations for the quadratic assignment problem

0 references

A note on lack of strong duality for quadratic problems with orthogonal constraints

0 references

On Lagrangian Relaxation of Quadratic Matrix Constraints

0 references

On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming

0 references

Nondifferentiable optimization and polynomial problems

0 references

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

0 references

Tightening a copositive relaxation for standard quadratic optimization problems

0 references

Computable representations for convex hulls of low-dimensional quadratic forms

0 references

Fractional Programming. I, Duality

0 references

A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid

0 references

An SDP approach for quadratic fractional problems with a two-sided quadratic constraint

0 references

On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint

0 references

Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares

0 references

Quadratic Matrix Programming

0 references

0 references

On the Solution of the Tikhonov Regularization of the Total Least Squares Problem

0 references

Efficiently solving total least squares with Tikhonov identical regularization

0 references

Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid

0 references

A linear-time algorithm for the trust region subproblem based on hidden convexity

0 references

A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants

0 references

A linear-time algorithm for trust region problems

0 references

Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization

0 references

Convex Relaxations of the Weighted Maxmin Dispersion Problem

0 references

On the Ball-Constrained Weighted Maximin Dispersion Problem

0 references

A semidefinite framework for trust region subproblems with applications to large scale minimization

0 references

On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues

0 references

On Cones of Nonnegative Quadratic Functions

0 references

New Results on Quadratic Minimization

0 references

Quadratic optimization over a second-order cone with linear equality constraints

0 references

Second-Order-Cone Constraints for Extended Trust-Region Subproblems

0 references

The trust region subproblem with non-intersecting linear constraints

0 references

How to convexify the intersection of a second order cone and a nonconvex quadratic

0 references

Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints

0 references

A new semidefinite programming relaxation scheme for a class of quadratic matrix problems

0 references

Quadratic programs with hollows

0 references

A Note on Polynomial Solvability of the CDT Problem

0 references

On the complexity of quadratic programming with two quadratic constraints

0 references

Solving Generalized CDT Problems via Two-Parameter Eigenvalues

0 references

Polynomial Solvability of Variants of the Trust-Region Subproblem

0 references

A generalized solution of the orthogonal Procrustes problem

0 references

On minimizing a quadratic function on Stiefel manifold

0 references

On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients

0 references

A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere

0 references

Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization

0 references

The Legendre–Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms

0 references

A note on Legendre-Fenchel conjugate of the product of two positive-definite quadratic forms

0 references

On local convexity of quadratic transformations

0 references

On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls

0 references

Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s40305-019-00286-5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2176821

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2176821&oldid=37597481"