Pages that link to "Item:Q4120313"

The following pages link to Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems (Q4120313):

Displaying 50 items.

• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
• 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)
• Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation (Q298374) (← links)
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
• Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
• Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty (Q322602) (← links)
• Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization (Q322926) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Optimal mapping of cloud virtual machines (Q325399) (← links)
• A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, tomotherapy, and cyberknife (Q337467) (← links)
• A non-parametric approach to demand forecasting in revenue management (Q342029) (← links)
• Divisive heuristic for modularity density maximization (Q342346) (← links)
• A convex optimization approach for solving the single-vehicle cyclic inventory routing problem (Q342382) (← links)
• From quasidifferentiable to directed subdifferentiable functions: exact calculus rules (Q346799) (← links)
• Convergence analysis of Taylor models and McCormick-Taylor models (Q367158) (← links)
• Improved relaxations for the parametric solutions of ODEs using differential inequalities (Q367169) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• On the global solution of multi-parametric mixed integer linear programming problems (Q367172) (← links)
• Interval bounds on the solutions of semi-explicit index-one DAEs. I: Analysis (Q368576) (← links)
• Interval bounds on the solutions of semi-explicit index-one DAEs. II: Computation (Q368577) (← links)
• Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← 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)
• A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
• Globally optimal algorithms for stratified autocalibration (Q408824) (← links)
• Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
• Stochastic dual dynamic programming applied to nonconvex hydrothermal models (Q439570) (← links)
• Rigorous filtering using linear relaxations (Q453629) (← links)
• A parametric branch and bound approach to suboptimal explicit hybrid MPC (Q463830) (← links)
• Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
• An improved decomposition-based heuristic to design a water distribution network for an irrigation system (Q475224) (← links)
• Extended formulations for convex envelopes (Q486393) (← links)
• Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
• Truss topology optimization with discrete design variables by outer approximation (Q486729) (← links)
• A cost minimization heuristic for the pooling problem (Q490199) (← links)
• Reverse propagation of McCormick relaxations (Q496587) (← 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)
• Differentiable McCormick relaxations (Q522264) (← links)
• Three enhancements for optimization-based bound tightening (Q522269) (← links)
• A computational approach to determine damage in infrastructure networks from outage reports (Q523173) (← links)
• Convergence analysis of multivariate McCormick relaxations (Q524904) (← 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)
• Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs (Q534256) (← links)