Jointly Constrained Biconvex Programming
From MaRDI portal
Publication:3671770
DOI10.1287/moor.8.2.273zbMath0521.90087OpenAlexW2048881327MaRDI QIDQ3671770
James E. Falk, Faiz A. Al-Khayyal
Publication date: 1983
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/644563efc07b079b5f56f97a8161c7df09c71cba
global convergencenonconvex programmingbilinear programmingbranch and bound algorithmcomputational experiencebiconvex functions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Bilinear programming and structured stochastic games, Application of Bayesian approach to numerical methods of global and stochastic optimization, A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics, Extended reverse-convex programming: an approximate enumeration approach to global optimization, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, A global optimization algorithm for linear fractional and bilinear programs, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, A relaxation method for nonconvex quadratically constrained quadratic programs, Non polyhedral convex envelopes for 1-convex functions, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, On consistency of bounding operations in deterministic global optimization, A note on the solution of bilinear programming problems by reduction to concave minimization, Deriving convex hulls through lifting and projection, Finding all solutions of nonlinearly constrained systems of equations, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, A global optimization for sustainable multi-domain global manufacturing, A reformulation-convexification approach for solving nonconvex quadratic programming problems, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, Global optimization for the biaffine matrix inequality problem, Lagrange duality and partitioning techniques in nonconvex global optimization, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Decomposition approach for the global minimization of biconcave functions over polytopes, An FPTAS for optimizing a class of low-rank functions over a polytope, A branch-and-reduce approach to global optimization, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Some results on the strength of relaxations of multilinear functions, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Global optimization of bilinear programs with a multiparametric disaggregation technique, A piecewise linearization framework for retail shelf space management models, Convex quadratic relaxations for mixed-integer nonlinear programs in power systems, Globally optimal algorithms for stratified autocalibration, Convex envelopes generated from finitely many compact convex sets, Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks, Lower bound functions for polynomials, Convex envelopes of products of convex and component-wise concave functions, Explicit convex and concave envelopes through polyhedral subdivisions, An integer linear programming approach for bilinear integer programming, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, On convex relaxations of quadrilinear terms, Jointly constrained bilinear programs and related problems: An overview, Global solution of optimization problems with signomial parts, Global maximization of a generalized concave multiplicative function, Convergence rate of McCormick relaxations, An improved decomposition-based heuristic to design a water distribution network for an irrigation system, Convex and concave envelopes: revisited and new perspectives, An all-linear programming relaxation algorithm for optimizing over the efficient set, An algorithm for indefinite quadratic programming with convex constraints, Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming, Existence and sum decomposition of vertex polyhedral convex envelopes, Exact \(L_{2}\)-norm plane separation, A new simplicial cover technique in constrained global optimization, Reduction of indefinite quadratic programs to bilinear programs, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, A survey of adjustable robust optimization, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, New solution approaches for the maximum-reliability stochastic network interdiction problem, Relaxations and discretizations for the pooling problem, Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions, A class of valid inequalities for multilinear 0-1 optimization problems, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Generalized bilinear programming. I: Models, applications and linear programming relaxation, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, A computational approach to determine damage in infrastructure networks from outage reports, An application of Lipschitzian global optimization to product design, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes, New multi-commodity flow formulations for the pooling problem, A new reformulation-linearization technique for bilinear programming problems, Global optimization of nonconvex problems with convex-transformable intermediates, Convex envelopes of bivariate functions through the solution of KKT systems, Generation of networks with prescribed degree-dependent clustering, Piecewise-linear approximations of multidimensional functions, A rigorous global filtering algorithm for quadratic constraints, A new two-level linear relaxed bound method for geometric programming problems, Trigonometric convex underestimator for the base functions in Fourier space, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Convex envelopes for edge-concave functions, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, Design of planar articulated mechanisms using branch and bound, Nonlinear separation of data via mixed 0-1 integer and linear programming, Maximizing perturbation radii for robust convex quadratically constrained quadratic programs, A general branch-and-bound framework for continuous global multiobjective optimization, Convexification of bilinear forms through non-symmetric lifting, Generalized bilinear programming: An application in farm management, Rigorous convex underestimators for general twice-differentiable problems, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Reformulation in mathematical programming: An application to quantum chemistry, A new Lagrangean approach to the pooling problem, Fair transfer price and inventory holding policies in two-enterprise supply chains, On the global minimization of concave functions, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Bilinear separation of two sets in \(n\)-space, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Finite convergence of algorithms for nonlinear programs and variational inequalities, Note on solving linear complementarity problems as jointly constrained bilinear programs, Global optimization algorithms for linearly constrained indefinite quadratic problems, Proof of convergence for a global optimization algorithm for problems with ordinary differential equations, A global optimization method, QBB, for twice-differentiable nonconvex optimization problem, Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Robust parameter design and optimization for quality engineering, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, On a stochastic bilevel programming problem, Linear Programming Relaxations of Quadratically Constrained Quadratic Programs, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, Data separation via a finite number of discriminant functions: a global optimization approach, On solving general reverse convex programming problems by a sequence of linear programs and line searches, A decomposition approach for global optimum search in QP, NLP and MINLP problems, Semidefinite programming hierarchies for constrained bilinear optimization, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, Sequential Bounding Methods for Two-Stage Stochastic Programs, Large-scale standard pooling problems with constrained pools and fixed demands, A multi-commodity flow formulation for the generalized pooling problem, Strong formulations for the pooling problem, On characterizing linear complementarity problems as linear programs, Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design, Tractable Relaxations of Composite Functions, Piecewise polyhedral formulations for a multilinear term, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines, Biconvex Models and Algorithms for Risk Management Problems, Alternative branching rules for some nonconvex problems, An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems, Tight convex relaxations for the expansion planning problem, Error bounds for monomial convexification in polynomial optimization, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, On the strength of recursive McCormick relaxations for binary polynomial optimization, A bilinear approach to the pooling problem†, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model, The Convex Hull of a Quadratic Constraint over a Polytope, Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information, 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, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, The Multilinear Polytope for Acyclic Hypergraphs, Smoothing Partially Exact Penalty Function of Biconvex Programming, A new framework to relax composite functions in nonlinear programs, Biconvex sets and optimization with biconvex functions: a survey and extensions, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, 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, Global optimization of general nonconvex problems with intermediate polynomial substructures, Duality bound method for the general quadratic programming problem with quadratic constraints, Reduction constraints for the global optimization of NLPs, A global supply chain model with transfer pricing and transportation cost allocation, Quasiconvex relaxations based on interval arithmetic, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, Unnamed Item, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Global optimization of general non-convex problems with intermediate bilinear substructures, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, Separable concave minimization via partial outer approximation and branch and bound, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, Performance of convex underestimators in a branch-and-bound framework, The computational complexity of the pooling problem, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, Convex hull representations for bounded products of variables, An objective penalty function method for biconvex programming, Relative Robust and Adaptive Optimization, Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games, Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Convex envelopes for ray-concave functions, On the Composition of Convex Envelopes for Quadrilinear Terms, Enhanced intersection cutting-plane approach for linear complementarity problems, New SOCP relaxation and branching rule for bipartite bilinear programs, A new linearization method for quadratic assignment problems, A new class of improved convex underestimators for twice continuously differentiable constrained NLPs, Polyhedra related to integer-convex polynomial systems, Linearity embedded in nonconvex programs, An algorithm for global solution to bi-parametric linear complementarity constrained linear programs, Global optimization of nonconvex problems with multilinear intermediates
