Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collection of test problems for constrained global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting special structure in semidefinite programming: a survey of theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of bilinear programs with a multiparametric disaggregation technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Programming: LP-Relaxations Also Converge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards strong duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate approach of global optimization for polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex underestimation strategies for signomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Mixed-Integer Signomial Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some transformation techniques with applications in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing polynomials via sum of squares over the gradient ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting equalities in polynomial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capital Expenditure Programming and Some Alternative Approaches to Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex polynomial programming problems having rational exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconvex Models and Algorithms for Risk Management Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex factorable programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class of global minimum bounds of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact penalty function approach for nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parametric disaggregation technique for global optimization of polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial mixed-integer nonlinear programming problems with free variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised Taha's algorithm for polynomial 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provable better Branch and Bound method for a nonconvex integer quadratic programming problem / rank
 
Normal rank

Latest revision as of 13:27, 10 July 2024

scientific article
Language Label Description Also known as
English
Univariate parameterization for global optimization of mixed-integer polynomial problems
scientific article

    Statements

    Univariate parameterization for global optimization of mixed-integer polynomial problems (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2015
    0 references
    global optimization
    0 references
    non-linear programming
    0 references
    integer programming
    0 references
    mixed-integer non-linear programming
    0 references
    0 references
    0 references

    Identifiers