Concept

Newton's method in optimization

Related publications (163)

Algorithm to calculate a large number of roots of the cross-product of Bessel functions

Juan Ramon Mosig, Michael Mattes, Francisco Edén Sorolla Rosario

This paper describes an algorithm to calculate a large number of roots of the cross-product of Bessel functions and of their first derivatives. The algorithm initially finds the roots of the zeroth order using an auxiliary function that exhibits the same r ...

Institute of Electrical and Electronics Engineers2013

Stochastic fluctuations and the detectability limit of network communities

Paolo De Los Rios, Jonas Liechti, Lucio Floretta

We have analyzed the detectability limits of network communities in the framework of the popular Girvan and Newman benchmark. By carefully taking into account the inevitable stochastic fluctuations that affect the construction of each and every instance of ...

American Physical Society2013

Real-time Optimized Rendezvous on Nonholonomic Resource-Constrained Robots

Alcherio Martinoli, Sven Adrian Gowal

In this work, we consider a group of differential-wheeled robots endowed with noisy relative positioning capabilities. We develop a decentralized approach based on a receding horizon controller to generate, in real-time, trajectories that guarantee the con ...

Springer2013

A two-level time step technique for the partitioned solution of one-dimensional arterial networks

Simone Deparis, Adelmo Cristiano Innocenza Malossi

In this work a numerical strategy to address the solution of the blood flow in one-dimensional arterial networks through a topology-based decomposition is presented. Such decomposition results in the local analysis of the blood flow in simple arterial segm ...

Elsevier2012

Merging meets matching in MC@NLO

The next-to-leading order accuracy for MC@NLO results exclusive in J light jets is achieved if the computation is based on matrix elements that feature J and J+1 QCD partons. The simultaneous prediction of observables which are exclusive in different light ...

Springer2012

A Generative Façade Design Method Based on Daylighting Performance Goals

Marilyne Andersen

Successful daylighting design is a complex task which requires the designer to consider numerous design elements and their effects on multiple performance criteria. Facades in particular include many variables which may dramatically impact daylighting perf ...

Taylor & Francis2012

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

Colin Neil Jones

This paper examines the computational complexity certification of the fast gradient method for the solution of the dual of a parametric con- vex program. To this end, a lower iteration bound is derived such that for all parameters from a compact set a solu ...

Springer Heidelberg2012

Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method

Colin Neil Jones

This paper proposes to use Nesterov's fast gradient method for the solution of linear quadratic model predictive control (MPC) problems with input constraints. The main focus is on the method's a priori computational complexity certification which consists ...

Institute of Electrical and Electronics Engineers2012

Fringe demodulation using the two-dimensional phase differencing operator

Pramod Rastogi

The Letter proposes a method for phase estimation from a fringe pattern. The proposed method relies on a parametric approach where the phase is locally approximated as a two-dimensional (2D) polynomial, with the ensuing polynomial coefficients as the respe ...

Optical Society of America2012

Integration of Online Learning into HTN Planning for Robotic Tasks

Francesco Mondada, Jean-Cédric Chappelier, Stéphane Magnenat

This paper extends hierarchical task network (HTN) planning with lightweight learning, considering that in robotics, actions have a non-zero probability of failing. Our work applies to A*-based HTN planners with lifting. We prove that the planner finds the ...

2012

Graph Chatbot

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.