Outer approximation algorithm for nondifferentiable optimization problems
From MaRDI portal
Publication:1836591
DOI10.1007/BF00934131zbMath0505.90068MaRDI QIDQ1836591
Publication date: 1984
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
global optimizationnondifferentiable optimizationLipschitz continuous functionssupport functionouter approximation algorithmnonconvex nondifferentiable functions
Related Items
An efficient algorithm for solving semi-infinite inequality problems with box constraints, 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, New LP bound in multivariate Lipschitz optimization: Theory and applications, Global optimization under Lipschitzian constraints, An effective nonsmooth optimization algorithm for locally Lipschitz functions, A new global optimization method for univariate constrained twice-differentiable NLP problems, Global optimization of univariate Lipschitz functions. I: Survey and properties, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, On an outer approximation concept in global optimization, MSO: a framework for bound-constrained black-box global optimization algorithms, Nondifferentiable optimization via smooth approximation: General analytical approach, An outer approximations approach to reliability-based optimal design of structures, Design of a single-loop digital controller by the method of inequalities, Finite-termination schemes for solving semi-infinite satisfycing problems, Stochastic Lipschitz dynamic programming
Cites Work
- Unnamed Item
- Unnamed Item
- A quadratically convergent algorithm for solving infinite dimensional inequalities
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Optimization of lipschitz continuous functions
