Jointly Constrained Biconvex Programming
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Bilinear programming and structured stochastic games
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- On consistency of bounding operations in deterministic global optimization
- A note on the solution of bilinear programming problems by reduction to concave minimization
- 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
- 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
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- An application of Lipschitzian global optimization to product design
- A new reformulation-linearization technique for bilinear programming problems
- Generalized bilinear programming: An application in farm management
- 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
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Lower bound functions for polynomials
- Deriving convex hulls through lifting and projection
- A global optimization for sustainable multi-domain global manufacturing
- 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
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Convex and concave envelopes: revisited and new perspectives
- A survey of adjustable robust optimization
- A class of valid inequalities for multilinear 0-1 optimization problems
- Global optimization of nonconvex problems with convex-transformable intermediates
- Convex envelopes of bivariate functions through the solution of KKT systems
- 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
- 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
- Rigorous convex underestimators for general twice-differentiable problems
- Fair transfer price and inventory holding policies in two-enterprise supply chains
- 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
- Finding all solutions of nonlinearly constrained systems of equations
- 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
- Decomposition approach for the global minimization of biconcave functions over polytopes
- 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
- A piecewise linearization framework for retail shelf space management models
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex relaxations of quadrilinear terms
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- 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
- Convex hull representations for bounded products of variables
- An objective penalty function method for biconvex programming
- Convex envelopes for ray-concave functions
- Robust parameter design and optimization for quality engineering
- Semidefinite programming hierarchies for constrained bilinear optimization
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems
- A new framework to relax composite functions in nonlinear programs
- 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
- 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
- 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
- New SOCP relaxation and branching rule for bipartite bilinear programs
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Global optimization of nonconvex problems with multilinear intermediates
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Data separation via a finite number of discriminant functions: a global optimization approach
- 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
- Error bounds for monomial convexification in polynomial optimization
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- 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
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Enhanced intersection cutting-plane approach for linear complementarity problems
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Polyhedra related to integer-convex polynomial systems
This page was built for publication: Jointly Constrained Biconvex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671770)
