Semidefinite relaxations of fractional programs via novel convexification techniques
From MaRDI portal
Publication:5954663
DOI10.1023/A:1011233805045zbMath1001.90064MaRDI QIDQ5954663
Nikolaos V. Sahinidis, Mohit Tawarmalani
Publication date: 10 December 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Semidefinite programming (90C22) Fractional programming (90C32) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes, A review of recent advances in global optimization, Exact and approximate results for convex envelopes of special structured functions over simplices, Non polyhedral convex envelopes for 1-convex functions, An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Solving generalized polynomial problem by using new affine relaxed technique, Deriving convex hulls through lifting and projection, Perspective Reformulations of the CTA Problem with L2 Distances, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, Alternative branching rules for some nonconvex problems, Tight convex relaxations for the expansion planning problem, On interval-subgradient and no-good cuts, A framework for globally optimizing mixed-integer signomial programs, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, Globally optimal algorithms for stratified autocalibration, (Global) optimization: historical notes and recent developments, Convex envelopes generated from finitely many compact convex sets, Convex envelopes of products of convex and component-wise concave functions, A new optimal electricity market bid model solved through perspective cuts, Explicit convex and concave envelopes through polyhedral subdivisions, A review of deterministic optimization methods in engineering and management, The Convex Hull of a Quadratic Constraint over a Polytope, Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program, On convex envelopes for bivariate functions over polytopes, Relaxations of factorable functions with convex-transformable intermediates, Extended formulations for convex envelopes, Convex underestimation for posynomial functions of positive variables, Existence and sum decomposition of vertex polyhedral convex envelopes, A new framework to relax composite functions in nonlinear programs, Practical global optimization for multiview geometry, A technique to derive the analytical form of convex envelopes for some bivariate functions, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, Convergence analysis of multivariate McCormick relaxations, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes, Global optimization of nonconvex problems with convex-transformable intermediates, Convex envelopes of bivariate functions through the solution of KKT systems, Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems, Minimizing the object space error for pose estimation: towards the most efficient algorithm, Unnamed Item, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, On tightness and anchoring of McCormick and other relaxations, A polyhedral branch-and-cut approach to global optimization, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, Performance of convex underestimators in a branch-and-bound framework, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems, Convex envelope of bivariate cubic functions over rectangular regions, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, A parametric solution method for a generalized fractional programming problem, Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, Convex envelopes for ray-concave functions, A sixth bibliography of fractional programming, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, A global optimization method, QBB, for twice-differentiable nonconvex optimization problem, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production, Approximated perspective relaxations: a project and lift approach
Uses Software
