Pages that link to "Item:Q3757690"

The following pages link to An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690):

Displaying 50 items.

• Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
• An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (Q2044966) (← links)
• A method for convex black-box integer global optimization (Q2045020) (← links)
• Partially distributed outer approximation (Q2046262) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization (Q2070360) (← links)
• Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
• On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints (Q2089868) (← links)
• Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
• Outer approximation for mixed-integer nonlinear robust optimization (Q2095574) (← links)
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
• An outer-approximation guided optimization approach for constrained neural network inverse problems (Q2097633) (← links)
• Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
• Sparse regression over clusters: SparClur (Q2115306) (← links)
• Submodularity and local search approaches for maximum capture problems under generalized extreme value models (Q2116913) (← links)
• Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
• Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
• Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation (Q2129194) (← links)
• A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
• Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
• A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm (Q2150758) (← links)
• A combined and robust modal-split/traffic assignment model for rail and road freight transport (Q2158025) (← links)
• The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
• The backbone method for ultra-high dimensional sparse machine learning (Q2163249) (← links)
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
• Sparse high-dimensional regression: exact scalable algorithms and phase transitions (Q2176621) (← links)
• A multicut outer-approximation approach for competitive facility location under random utilities (Q2178115) (← links)
• An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
• Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
• Stacking sequence and shape optimization of laminated composite plates via a level-set method (Q2208621) (← links)
• Sparse regression: scalable algorithms and empirical performance (Q2225311) (← links)
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• First order rejection tests for multiple-objective optimization (Q2250111) (← links)
• Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand (Q2253993) (← links)
• Linearization of mixed-integer products (Q2277364) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• Derivative-free robust optimization by outer approximations (Q2288189) (← links)
• Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis (Q2289937) (← links)