Norm-induced cuts: outer approximation for Lipschitzian constraint functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3215519 (Why is no real title available?)
- A DIRECT-type approach for derivative-free constrained global optimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- A modified version of Tuy's method for solving d.c. programing problem
- A partition-based global optimization algorithm
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
- An algorithm for finding the absolute extremum of a function
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Combining Bayesian optimization and Lipschitz optimization
- Convex programs with an additional reverse convex constraint
- Deterministic global optimization. An introduction to the diagonal approach
- Differential properties of the marginal function in mathematical programming
- Encyclopedia of Optimization
- Estimation of the Lipschitz constant of a function
- Evaluating Gas Network Capacities
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Handbook of global optimization
- Inner approximation method for a reverse convex programming problem
- Introduction to Derivative-Free Optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Iterative Solution of Nonlinear Equations in Several Variables
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- Pattern Search Algorithms for Bound Constrained Minimization
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- PySCIPOpt-ML: embedding trained machine learning models into mixed-integer programs
- Robust optimization for unconstrained simulation-based problems
- Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming
- Simplicial global optimization
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Towards simulation based mixed‐integer optimization with differential equations
- Using DIRECT to solve an aircraft routing problem
- Using neural networks to solve linear bilevel problems with unknown lower level
This page was built for publication: Norm-induced cuts: outer approximation for Lipschitzian constraint functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851201)
