An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
From MaRDI portal
Publication:857806
DOI10.1007/s10898-006-9005-4zbMath1131.90045OpenAlexW2137254586MaRDI QIDQ857806
Constantinos C. Pantelides, Leo Liberti
Publication date: 5 January 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9005-4
NLPGlobal optimizationBilinearConvex relaxationReformulation-linearization techniqueRRLT constraints
Related Items
Global optimization with spline constraints: a new branch-and-bound method based on B-splines, Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, Large-scale standard pooling problems with constrained pools and fixed demands, Strong formulations for the pooling problem, GLOMIQO: global mixed-integer quadratic optimizer, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, 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, Decomposition strategy for the stochastic pooling problem, On interval-subgradient and no-good cuts, A framework for globally optimizing mixed-integer signomial programs, Holistic fleet optimization incorporating system design considerations, Exclusion tendency-based observer design framework for active fault diagnosis, Topology optimization of adaptive structures: new limits of material economy, Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks, A reformulation-linearization technique for optimization over simplices, Reduced RLT representations for nonconvex polynomial programming problems, Stochastic dual dynamic programming applied to nonconvex hydrothermal models, Global minimization using an augmented Lagrangian method with variable lower-level constraints, A cost minimization heuristic for the pooling problem, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, Relaxations and discretizations for the pooling problem, Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems, Cutting ellipses from area-minimizing rectangles, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods, Optimal influenza vaccine distribution with equity, Reformulations in Mathematical Programming: Definitions and Systematics, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, Reformulation in mathematical programming: An application to quantum chemistry, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, Cutting circles and polygons from area-minimizing rectangles, A new Lagrangean approach to the pooling problem, Solving certain complementarity problems in power markets via convex programming, The value of shape constraints in discrete moment problems: a review and extension
Cites Work
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Global minimization by reducing the duality gap
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Convex envelopes of monomials of odd degree
- Handbook of global optimization. Vol. 2
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Persistency in 0-1 Polynomial Programming
- Pooling Problem: Alternate Formulations and Solution Methods
- Jointly Constrained Biconvex Programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- The Consistent Initialization of Differential-Algebraic Systems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A bilinear approach to the pooling problem†
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Convex analysis and global optimization
- Combinatorial optimization. Theory and algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
