Publication

Implementation techniques for the SCFO experimental optimization framework

Dominique Bonvin, Grégory François
2014
Working Papers

Abstract

The material presented in this document is intended as a comprehensive, implementation-oriented supplement to the experimental optimization framework presented in [Bunin, G.A., Francois, G., Bonvin, D.: Feasible-side global convergence in experimental optimization. SIAM J. Optim. (submitted) (2014)]. The issues of physical degradation, unknown Lipschitz constants, measurement/estimation noise, gradient estimation, sufficient excitation, and the handling of soft constraints and/or a numerical cost function are all addressed, and a robust, implementable version of the sufficient conditions for feasible-side global convergence is proposed.

Official source

https://infoscience.epfl.ch/entities/publication/dee4f897-3930-4229-91d4-2e9f585f0fd5

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Dominique Bonvin, Grégory François
2014
Working Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/dee4f897-3930-4229-91d4-2e9f585f0fd5

About this result

Related concepts (32)

Mathematical optimization

Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.

Multidisciplinary design optimization

Multi-disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. It is also known as multidisciplinary system design optimization (MSDO), and Multidisciplinary Design Analysis and Optimization (MDAO). MDO allows designers to incorporate all relevant disciplines simultaneously. The optimum of the simultaneous problem is superior to the design found by optimizing each discipline sequentially, since it can exploit the interactions between the disciplines.

Ant colony optimization algorithms

In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.

Related publications (22)

Implementation techniques for the SCFO experimental optimization framework

Chat with Graph Search

Deep Geometric Learning in Engineering Design

Sensor network localization has a benign landscape after low-dimensional relaxation

Discovering Partial Differential Equations With Neural Cellular Automata