Convex and concave relaxations of implicit functions
From MaRDI portal
Publication:2943829
DOI10.1080/10556788.2014.924514zbMath1327.65114OpenAlexW2140637471MaRDI QIDQ2943829
Joseph K. Scott, Paul I. Barton, Matthew D. Stuber
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.924514
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)
Related Items
EAGO.jl: easy advanced global optimization in Julia ⋮ Implicit parametrizations and applications in optimization and control ⋮ Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space ⋮ Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ Optimal deterministic algorithm generation ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ Extended McCormick relaxation rules for handling empty arguments representing infeasibility ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ General convex relaxations of implicit functions and inverse functions ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ Deterministic global optimization with artificial neural networks embedded ⋮ Whitney differentiability of optimal-value functions for bound-constrained convex programming problems ⋮ Reverse propagation of McCormick relaxations ⋮ Differentiable McCormick relaxations ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Reachability Analysis and Deterministic Global Optimization of DAE Models ⋮ Deterministic global optimization with Gaussian processes embedded ⋮ Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interval Newton method
- Generalized McCormick relaxations
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- A parallel algorithm for constrained concave quadratic global minimization
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- Constraint decomposition algorithms in global optimization
- A reduced space branch and bound algorithm for global optimization.
- A polyhedral branch-and-cut approach to global optimization
- Rigorous convex underestimators for general twice-differentiable problems
- A branch-and-reduce approach to global optimization
- Preconditioners for the Interval Gauss–Seidel Method
- Evaluating Derivatives
- McCormick-Based Relaxations of Algorithms
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Algorithm 811: NDA
- An Algorithm for Separable Nonconvex Programming Problems
