Pages that link to "Item:Q3671770"
From MaRDI portal
The following pages link to Jointly Constrained Biconvex Programming (Q3671770):
Displayed 50 items.
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics (Q285928) (← links)
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Globally optimal algorithms for stratified autocalibration (Q408824) (← links)
- Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
- An integer linear programming approach for bilinear integer programming (Q435736) (← links)
- An improved decomposition-based heuristic to design a water distribution network for an irrigation system (Q475224) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- A computational approach to determine damage in infrastructure networks from outage reports (Q523173) (← links)
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- Note on solving linear complementarity problems as jointly constrained bilinear programs (Q809900) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations (Q811878) (← links)
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Global solution of optimization problems with signomial parts (Q924639) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Exact \(L_{2}\)-norm plane separation (Q941041) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- Nonlinear separation of data via mixed 0-1 integer and linear programming (Q990586) (← links)
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- A new Lagrangean approach to the pooling problem (Q1037357) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- Bilinear programming and structured stochastic games (Q1076625) (← links)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
- On consistency of bounding operations in deterministic global optimization (Q1101343) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- An algorithm for indefinite quadratic programming with convex constraints (Q1180839) (← links)