Convex and concave relaxations of implicit functions
From MaRDI portal
Recommendations
Cites work
- A branch-and-reduce approach to global optimization
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A parallel algorithm for constrained concave quadratic global minimization
- A polyhedral branch-and-cut approach to global optimization
- A reduced space branch and bound algorithm for global optimization.
- Algorithm 811: NDA
- An Algorithm for Separable Nonconvex Programming Problems
- An interval Newton method
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- Constraint decomposition algorithms in global optimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Evaluating Derivatives
- Generalized McCormick relaxations
- scientific article; zbMATH DE number 48445 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- McCormick-Based Relaxations of Algorithms
- Preconditioners for the Interval Gauss–Seidel Method
- Rigorous convex underestimators for general twice-differentiable problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Cited in
(25)- 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
- Deterministic global optimization with artificial neural networks embedded
- Relaxation of convex functionals: the gap problem
- Deterministic global optimization with Gaussian processes embedded
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- An implicit function approach to constrained optimization with applications to asymptotic expansions
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Improved convex and concave relaxations of composite bilinear forms
- Reachability analysis and deterministic global optimization of DAE models
- scientific article; zbMATH DE number 2066982 (Why is no real title available?)
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
- Reduction constraints for the global optimization of NLPs
- Reverse propagation of McCormick relaxations
- EAGO.jl: easy advanced global optimization in Julia
- Differentiable 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
- Automatic source code generation for deterministic global optimization with parallel architectures
- Implicit parametrizations and applications in optimization and control
This page was built for publication: Convex and concave relaxations of implicit functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943829)
