Add to ORKGWe discuss first and second order optimality conditions for nonlinear second-order cone programming problems, and their relation with semidefinite programming problems. For doing this we extend in an abstract setting the notion of optimal partition. Then we state a characterization of strong regularity
In this paper, with reference to limited-angle data configurations, the performance of the nonlinear...
The FFLAS project has established that exact matrix multiplication over finite fields can be perform...
The convergence rate of the approximation of a non-smooth, typically discontinuous function can be m...
The form of topological derivatives for shape functionals for contact problems is established. Metho...
International audienceThis paper deals with problems arising in the sensitivity analysis for fluid-s...
We study a family of implementations for linked lists using fine-grain synchronisation. This approac...
This article deals with problems arising in the sensitivity analysis for fluid-structure interaction...
We present new algorithms for the inverse, division, and square root of power series. The key trick ...
We consider the one dimensional planar rotator and classical Heisenberg models with a ferromagnetic ...
The forward kinematics problem of parallel robot consists in computing the position of a solid movin...
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs,...
Based on the theory of non-negative supermartingales, convergence results are proven for adaptive (1...
Opium is a system for analysing and debugging Prolog programs. Its kernel comprises an execution tra...
A message is {\it in-transit} with respect to a global state if its sending is recorded in this glob...
In this paper, we propose computational methods for the synthesis of controllers for discrete event ...
In this paper, with reference to limited-angle data configurations, the performance of the nonlinear...
The FFLAS project has established that exact matrix multiplication over finite fields can be perform...
The convergence rate of the approximation of a non-smooth, typically discontinuous function can be m...
The form of topological derivatives for shape functionals for contact problems is established. Metho...
International audienceThis paper deals with problems arising in the sensitivity analysis for fluid-s...
We study a family of implementations for linked lists using fine-grain synchronisation. This approac...
This article deals with problems arising in the sensitivity analysis for fluid-structure interaction...
We present new algorithms for the inverse, division, and square root of power series. The key trick ...
We consider the one dimensional planar rotator and classical Heisenberg models with a ferromagnetic ...
The forward kinematics problem of parallel robot consists in computing the position of a solid movin...
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs,...
Based on the theory of non-negative supermartingales, convergence results are proven for adaptive (1...
Opium is a system for analysing and debugging Prolog programs. Its kernel comprises an execution tra...
A message is {\it in-transit} with respect to a global state if its sending is recorded in this glob...
In this paper, we propose computational methods for the synthesis of controllers for discrete event ...
In this paper, with reference to limited-angle data configurations, the performance of the nonlinear...
The FFLAS project has established that exact matrix multiplication over finite fields can be perform...
The convergence rate of the approximation of a non-smooth, typically discontinuous function can be m...