UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 141

Sortiert nach

Outer-product-free sets for polynomial optimization and oracle-based cuts

Mathematical programming, 2020-09, Vol.183 (1-2), p.105-148

2020

Link zum Volltext

Verfügbarkeit prüfen

Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting

Journal of global optimization, 2020-04, Vol.76 (4), p.913-932

2020

Link zum Volltext

Verfügbarkeit prüfen

Quadratic optimization with switching variables: the convex hull for n=2

Mathematical programming, 2021-08, Vol.188 (2), p.421-441

2021

Link zum Volltext

Verfügbarkeit prüfen

Quartic First-Order Methods for Low-Rank Minimization

Journal of optimization theory and applications, 2021-05, Vol.189 (2), p.341-363

2021

Link zum Volltext

Verfügbarkeit prüfen

Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

Mathematical programming, 2010-07, Vol.124 (1-2), p.383-411

2010

Link zum Volltext

Verfügbarkeit prüfen

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

Mathematical programming, 2011-09, Vol.129 (1), p.129-157

2011

Link zum Volltext

Verfügbarkeit prüfen

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

Mathematical programming, 2016-03, Vol.156 (1-2), p.161-187

2016

Link zum Volltext

Verfügbarkeit prüfen

An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints

Journal of global optimization, 2017-03, Vol.67 (3), p.475-493

2017

Link zum Volltext

Verfügbarkeit prüfen

The trust region subproblem with non-intersecting linear constraints

Mathematical programming, 2015-02, Vol.149 (1-2), p.253-264

2015

Link zum Volltext

Verfügbarkeit prüfen

An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems

Journal of optimization theory and applications, 2022-03, Vol.192 (3), p.830-855

2022

Link zum Volltext

Verfügbarkeit prüfen

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

Mathematical programming, 2011-10, Vol.129 (2), p.301-329

2011

Link zum Volltext

Verfügbarkeit prüfen

Relaxing the optimality conditions of box QP

Computational optimization and applications, 2011-04, Vol.48 (3), p.653-673

2011

Link zum Volltext

Verfügbarkeit prüfen

A robust Lagrangian-DNN method for a class of quadratic optimization problems

Computational optimization and applications, 2017-04, Vol.66 (3), p.453-479

2017

Link zum Volltext

Verfügbarkeit prüfen

Separation and relaxation for cones of quadratic forms

Mathematical programming, 2013-02, Vol.137 (1-2), p.343-370

2013

Link zum Volltext

Verfügbarkeit prüfen

A note on completely positive relaxations of quadratic problems in a multiobjective framework

Journal of global optimization, 2022-03, Vol.82 (3), p.615-626

2022

Link zum Volltext

Verfügbarkeit prüfen

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming

Journal of global optimization, 2019-02, Vol.73 (2), p.371-388

2019

Link zum Volltext

Verfügbarkeit prüfen

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

Mathematical programming, 2011-12, Vol.130 (2), p.359-413

2011

Link zum Volltext

Verfügbarkeit prüfen

Role of sparsity and structure in the optimization landscape of non-convex matrix sensing

Mathematical programming, 2022-05, Vol.193 (1), p.75-111

2022

Link zum Volltext

Verfügbarkeit prüfen

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

Mathematical programming, 2019-11, Vol.178 (1-2), p.215-262

2019

Link zum Volltext

Verfügbarkeit prüfen

Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization

Optimization and engineering, 2010-02, Vol.11 (1), p.45-66

2010

Link zum Volltext

Verfügbarkeit prüfen

Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem

Mathematical methods of operations research (Heidelberg, Germany), 2014-04, Vol.79 (2), p.225-237

2014

Link zum Volltext

Verfügbarkeit prüfen

Uniqueness in Nuclear Norm Minimization: Flatness of the Nuclear Norm Sphere and Simultaneous Polarization

Journal of optimization theory and applications, 2023-04, Vol.197 (1), p.252-276

2023

Link zum Volltext

Verfügbarkeit prüfen

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

Journal of global optimization, 2009-03, Vol.43 (2-3), p.471-484

Anstreicher, Kurt M.

2009

Link zum Volltext

Verfügbarkeit prüfen

Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods

Journal of optimization theory and applications, 2019-03, Vol.180 (3), p.964-992

2019

Link zum Volltext

Verfügbarkeit prüfen

Conic approximation to quadratic optimization with linear complementarity constraints

Computational optimization and applications, 2017, Vol.66 (1), p.97-122

2017

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 141

Suche als RSS-Feed

Aktive Filter

SpracheSlowenisch

ThemaMathematics And Statistics

ThemaOptimization

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(141)
Mit Volltextzugriff
(141)

Publikationsform

Artikel
(141)

Sprache

Englisch
(141)
Japanisch
(11)

Erscheinungsjahr

n.n

Thema

Mathematics
(141)
Science & Technology
(137)
Physical Sciences
(136)
Mathematics, Applied
(126)
Technology
(116)
Operations Research & Management Science
(112)
Operations Research/decision Theory
(93)
Computer Science
(66)
Studies
(62)
Calculus Of Variations And Optimal Control; Optimization
(54)
Algorithms
(52)
Mathematical Analysis
(51)
Mathematical And Computational Physics
(39)
Semidefinite Programming
(39)
Theoretical
(39)
Mathematical Models
(37)
Mathematical Methods In Physics
(33)
Mathematical Programming
(32)

13 weitere anzeigen...

Weniger anzeigen...

Kollektion

2 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Outer-product-free sets for polynomial optimization and oracle-based cuts

Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting

Quadratic optimization with switching variables: the convex hull for n=2

Quartic First-Order Methods for Low-Rank Minimization

Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints

The trust region subproblem with non-intersecting linear constraints

An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

Relaxing the optimality conditions of box QP

A robust Lagrangian-DNN method for a class of quadratic optimization problems

Separation and relaxation for cones of quadratic forms

A note on completely positive relaxations of quadratic problems in a multiobjective framework

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

Role of sparsity and structure in the optimization landscape of non-convex matrix sensing

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization

Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem

Uniqueness in Nuclear Norm Minimization: Flatness of the Nuclear Norm Sphere and Simultaneous Polarization

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods

Conic approximation to quadratic optimization with linear complementarity constraints

Aktive Filter

Suchergebnisse filtern