Suchergebnisse - 90c22 mathematical programming - semidefinite programing~

  • Treffer 1 - 12 von 12
Treffer weiter einschränken
  1. 1

    Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones

    Autoren: Andersen, Martin S. Dahl, Joachim Vandenberghe, Lieven

    Quelle: Mathematical Programming Computation: A Publication of the Mathematical Optimization Society. 2(3)

    Schlagwörter: Mathematics, Operations Research/Decision Theory, Optimization, 90-08 Mathematical Programming - computational methods, 90C06 Mathematical Programming - large-scale, 90C22 Mathematical Programming - semidefinite programing, 90C25 Mathematical Programming - convex programming, 90C51 Mathematical Programming - interior-point methods

    Dateibeschreibung: application/pdf

    Zugangs-URL: https://escholarship.org/uc/item/2175g56s
    https://escholarship.org/content/qt2175g56s/qt2175g56s.pdf

    View record at eScholarship
    Zu den Favoriten
  2. 2

    The Chvátal–Gomory procedure for integer SDPs with applications in combinatorial optimization.

    Autoren: de Meijer, Frank Sotirov, Renata

    Quelle: Mathematical Programming; Jan2025, Vol. 209 Issue 1, p323-395, 73p

    Schlagwörter: TRAVELING salesman problem, MATHEMATICAL programming, COMPUTATIONAL mathematics, COMBINATORIAL optimization, SEMIDEFINITE programming

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    The Euclidean distortion of generalized polygons.

    Autoren: Kobayashi, Toshimasa Kondo, Takefumi

    Quelle: Advances in Geometry; Oct2015, Vol. 15 Issue 4, p499-506, 8p

    Schlagwörter: EUCLIDEAN geometry, POLYGONS, SEMIDEFINITE programming, EMBEDDINGS (Mathematics), GRAPH theory, DIAMETER

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems.

    Autoren: Kim, Sunyoung Kojima, Masakazu Waki, Hayato

    Quelle: SIAM Journal on Optimization; 2005, Vol. 15 Issue 3, p697-719, 23p, 4 Charts

    Schlagwörter: LAGRANGE equations, DIFFERENTIAL equations, POLYNOMIALS, MATHEMATICAL optimization, MATHEMATICAL analysis

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization.

    Autoren: Yang, Heng Liang, Ling Carlone, Luca et al.

    Quelle: Mathematical Programming; Sep2023, Vol. 201 Issue 1/2, p409-472, 64p

    Schlagwörter: NONLINEAR programming, NONCONVEX programming, SEMIDEFINITE programming, POLYNOMIALS

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    Noisy tensor completion via the sum-of-squares hierarchy.

    Autoren: Barak, Boaz Moitra, Ankur

    Quelle: Mathematical Programming; Jun2022, Vol. 193 Issue 2, p513-548, 36p

    Schlagwörter: LINGUISTIC complexity, CONSTRAINT satisfaction, SEMIDEFINITE programming

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

    Universal rigidity of bar frameworks via the geometry of spectrahedra.

    Autoren: Alfakih, A.

    Quelle: Journal of Global Optimization; Apr2017, Vol. 67 Issue 4, p909-924, 16p

    Schlagwörter: DISTANCE geometry, SPECTRAL synthesis (Mathematics), CAYLEY graphs, SEMIDEFINITE programming, EUCLIDEAN geometry, EDGES (Geometry)

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  8. 8

    The minimal cone for conic linear programming.

    Autoren: Zhang, Qinghong

    Quelle: 4OR (1619-4500); Dec2011, Vol. 9 Issue 4, p403-416, 14p

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  9. 9

    Multihomogeneous Nonnegative Polynomials and Sums of Squares.

    Autoren: Ergür, Alperen A.

    Quelle: Discrete & Computational Geometry; Sep2018, Vol. 60 Issue 2, p318-344, 27p

    Schlagwörter: POLYNOMIALS, SQUARE, MATHEMATICAL bounds, FRACTIONS, ADDITION (Mathematics)

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  10. 10

    Sum-of-squares rank upper bounds for matching problems.

    Autoren: Kurpisz, Adam Leppänen, Samuli Mastrolilli, Monaldo

    Quelle: Journal of Combinatorial Optimization; Oct2018, Vol. 36 Issue 3, p831-844, 14p

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  11. 11

    50 Years of Integer Programming 1958-2008

    Autoren: Michael Jünger Thomas M. Liebling Denis Naddef et al.

    Resource Type: eBook.

    Schlagworte: Discrete mathematics, Mathematical optimization, Computer science—Mathematics, Operations research

    Categories: MATHEMATICS / Discrete Mathematics, BUSINESS & ECONOMICS / Operations Research, COMPUTERS / Computer Science, MATHEMATICS / Optimization

    Zu den Favoriten
  12. 12

    Encyclopedia of Optimization

    Autoren: Christodoulos A. Floudas Panos M. Pardalos

    Resource Type: eBook.

    Schlagworte: Mathematical optimization--Encyclopedias

    Categories: MATHEMATICS / Optimization, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied

    Zu den Favoriten

Suchwerkzeuge: