Diagonal generalizaton of the DIRECT method for problems with constraints

DOI10.1134/S0005117920080068zbMATH Open1457.90115OpenAlexW3090891051MaRDI QIDQ828532FDOQ828532

Authors: S. Yu. Gorodetsky 

Publication date: 9 January 2021

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117920080068

Recommendations

• Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
• The DIRECT algorithm: 25 years later
• scientific article; zbMATH DE number 1795727
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
• A DIRECT-type approach for derivative-free constrained global optimization

zbMATH Keywords

global optimizationnumerical experimentsLipschitz functionsdiscontinuous functionsDIRECT methodmultiextremal constraintstwo-point diagonal scheme

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• A locally-biased form of the DIRECT algorithm.
• Lipschitzian optimization without the Lipschitz constant
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Synthesis of control laws on the basis of matrix inequalities
• Title not available (Why is that?)
• \(H_\infty\) control and estimation of state-multiplicative linear systems.
• Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
• Parallel global optimization of functions of several variables
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
• A univariate global search working with a set of Lipschitz constants for the first derivative
• Title not available (Why is that?)
• Pareto optimal generalized \(H_2\)-control and vibroprotection problems
• Title not available (Why is that?)

Cited In (4)

• AN EXTENSION OF LEITMANN'S DIRECT METHOD TO INEQUALITY CONSTRAINTS
• A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• Diagonalizability of constraint propagation matrices

This page was built for publication: Diagonal generalizaton of the DIRECT method for problems with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828532)