On the Pareto optimality in the context of Lipschitzian optimization
From MaRDI portal
Publication:4917441
Recommendations
- On the experimental investigation of Pareto-Lipschitzian optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- scientific article; zbMATH DE number 757681
- Lipschitzian optimization without the Lipschitz constant
- Optimal algorithms for global optimization in case of unknown Lipschitz constant
Cited in
(10)- The DIRECT algorithm: 25 years later
- Simplicial Lipschitz optimization without the Lipschitz constant
- On the experimental investigation of Pareto-Lipschitzian optimization
- scientific article; zbMATH DE number 6678440 (Why is no real title available?)
- scientific article; zbMATH DE number 3910084 (Why is no real title available?)
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Branch-and-Model: a derivative-free global optimization algorithm
- A new partition method for DIRECT-type algorithm based on minimax design
- An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
This page was built for publication: On the Pareto optimality in the context of Lipschitzian optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917441)
