Global optimization of nonconvex factorable programming problems
From MaRDI portal
Publication:5930738
DOI10.1007/s101070000196zbMath0985.90073MaRDI QIDQ5930738
Hanif D. Sherali, Hongjie Wang
Publication date: 3 October 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Extended reverse-convex programming: an approximate enumeration approach to global optimization, A review of recent advances in global optimization, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, On linear programming relaxations for solving polynomial programming problems, Global optimization of non-convex piecewise linear regression splines, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem, Explicit convex and concave envelopes through polyhedral subdivisions, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs, Relaxations of factorable functions with convex-transformable intermediates, Modeling probability densities with sums of exponentials via polynomial approximation, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Global optimization of general nonconvex problems with intermediate polynomial substructures, Reduction constraints for the global optimization of NLPs, Global optimization of nonconvex problems with convex-transformable intermediates, RLT: A unified approach for discrete and continuous nonconvex optimization, Reformulations in Mathematical Programming: Definitions and Systematics, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, A geometric branch and bound method for robust maximization of convex functions, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, Univariate parameterization for global optimization of mixed-integer polynomial problems, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
