Extended Reverse Convex Programming: An Active-Set Approach to Global Optimization

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In order to extract maximum surplus from a heterogeneous customer base it is common practice for firms to offer a portfolio of differentiated products, from which consumers of different preferences can select their favorite items. The standard model of pro ...

The application of kernel-based Machine Learning (ML) techniques to discrete choice modelling using large datasets often faces challenges due to memory requirements and the considerable number of parameters involved in these models. This complexity hampers ...

A de facto standard approach in solving computer vision tasks is to use a common high-resolution camera and choose its placement on an agent based on human intuition. On the other hand, extremely simple and well-designed visual sensors found throughout nat ...

We develop a model-free approach to optimally control stochastic, Markovian systems subject to a reach-avoid constraint. Specifically, the state trajectory must remain within a safe set while reaching a target set within a finite time horizon. Due to the t ...

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

We develop new tools to study landscapes in nonconvex optimization. Given one optimization problem, we pair it with another by smoothly parametrizing the domain. This is either for practical purposes (e.g., to use smooth optimization algorithms with good g ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

Social Engagement is a novel business model whose goal is transforming final users of a service from passive components into active ones. In this framework, people are contacted by the decision-maker (generally a company) and they are asked to perform task ...

In this paper, we present a new parameterization and optimization procedure for minimizing the weight of ribbed plates. The primary goal is to reduce embodied CO2 in concrete floors as part of the effort to diminish the carbon footprint of the construction ...

A method for optimizing at least one of a geometry, an implantation procedure, and/or stimulation protocol of one or more electrodes for an electrical stimulation of a target structure in a nervous system of a living being by a computer device, the method ...

This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models c ...

In various robotics applications, the selection of function approximation methods greatly influences the feasibility and computational efficiency of algorithms. Tensor Networks (TNs), also referred to as tensor decomposition techniques, present a versatile ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

We report the detailed background for the discovery and development of the synthesis of homopropargylic azides by the azidoalkynylation of alkenes. Initially, a strategy involving SOMOphilic alkynes was adopted, but only resulted in a 29% yield of the desi ...

The ever-increasing impact of deploying renewable energy resources reducing power system inertia, requires distributed energy resource (DER) aggregators to secure high-performance, fast-responding primary frequency reserve (PFR) in ancillary service market ...

Electronic devices play an irreplaceable role in our lives. With the tightening time to market, exploding demand for computing power, and continuous desire for smaller, faster, less energy-consuming, and lower-cost chips, computer-aided design for electron ...

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

We study the problem of performance optimization of closed -loop control systems with unmodeled dynamics. Bayesian optimization (BO) has been demonstrated to be effective for improving closed -loop performance by automatically tuning controller gains or re ...

Extended Reverse Convex Programming: An Active-Set Approach to Global Optimization

Chattez avec Graph Search

Robust Optimization for Product Line Design

Scalable kernel logistic regression with Nyström approximation: Theoretical analysis and application to discrete choice modelling

How Far Can a 1-Pixel Camera Go? Solving Vision Tasks Using Photoreceptors and Computationally Designed Visual Morphology

A learning-based approach to stochastic optimal control under reach-avoid constraint

Scalable constrained optimization

The effect of smooth parametrizations on nonconvex optimization landscapes

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Workforce Allocation for Social Engagement Services via Stochastic Optimization

Mesh-based topology, shape and sizing optimization of ribbed plates

A method and system for optimizing design, implantation, and stimulation protocols of electrodes stimulating the nervous system

Perturbed Utility Stochastic Traffic Assignment

The complexity of quantum support vector machines

Robot Learning using Tensor Networks

A ride time-oriented scheduling algorithm for dial-a-ride problems

SOMOphilic alkyne vs radical-polar crossover approaches: The full story of the azido-alkynylation of alkenes

Stochastic Risk-driven Bidding of a Solar and Storage Aggregator in Primary Frequency and Energy Markets: A Performance-based Capacity Allocation Approach

Contemporary Logic Synthesis: with an Application to AQFP Circuit Optimization

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Violation-aware contextual Bayesian optimization for controller performance optimization with unmodeled constraints