Outer approximation algorithm for nondifferentiable optimization problems
From MaRDI portal
(Redirected from Publication:1836591)
Cites work
- A quadratically convergent algorithm for solving infinite dimensional inequalities
- scientific article; zbMATH DE number 3559309 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimization of lipschitz continuous functions
- Semismooth and Semiconvex Functions in Constrained Optimization
Cited in
(19)- An algorithm for global optimization of Lipschitz continuous functions
- Outer approximation by polyhedral convex sets
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Nondifferentiable optimization via smooth approximation: General analytical approach
- An outer approximations approach to reliability-based optimal design of structures
- Finite-termination schemes for solving semi-infinite satisfycing problems
- An efficient algorithm for solving semi-infinite inequality problems with box constraints
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Stochastic Lipschitz dynamic programming
- Global optimization under Lipschitzian constraints
- On an outer approximation concept in global optimization
- Design of a single-loop digital controller by the method of inequalities
- MSO: a framework for bound-constrained black-box global optimization algorithms
- Decomposition methods for global solution of mixed-integer linear programs
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- A new global optimization method for univariate constrained twice-differentiable NLP problems
This page was built for publication: Outer approximation algorithm for nondifferentiable optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836591)
