An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation
An implicit iteration method for variational inequalities over the set of common fixed points for a finite family of nonexpansive mappings in Hilbert spaces.
An improved convergence analysis of a superquadratic method for solving generalized equations.
An Interactive Algorithm for Large Scale Multiple Objective Programming Problems With Fuzzy Parameters Through Topsis Approach
An interior-point algorithm for semidefinite least-squares problems
We propose a feasible primal-dual path-following interior-point algorithm for semidefinite least squares problems (SDLS). At each iteration, the algorithm uses only full Nesterov-Todd steps with the advantage that no line search is required. Under new appropriate choices of the parameter which defines the size of the neighborhood of the central-path and of the parameter which determines the rate of decrease of the barrier parameter, we show that the proposed algorithm is well defined and converges...
An Interval Arithmetic Algorithm for Multivariate Constrained Global Optimization Using Cord-Slope Forms of Taylor's Expansion
An iteration method for common solution of a system of equilibrium problems in Hilbert spaces.
An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces.
An iterative method for solving the generalized system of relaxed cocoercive quasivariational inclusions and fixed point problems of an infinite family of strictly pseudocontractive mappings.
An Iterative Procedure for the Solution of Constrained Nonlinear Equations with Application to Optimization Problems.
An L2-Error Estimate for an Approximation of the Solution of a Parabolic Variational Inequality.
An optimum design problem in magnetostatics
In this paper, we are interested in finding the optimal shape of a magnet. The criterion to maximize is the jump of the electromagnetic field between two different configurations. We prove existence of an optimal shape into a natural class of domains. We introduce a quasi-Newton type algorithm which moves the boundary. This method is very efficient to improve an initial shape. We give some numerical results.
An Optimum Design Problem in Magnetostatics
In this paper, we are interested in finding the optimal shape of a magnet. The criterion to maximize is the jump of the electromagnetic field between two different configurations. We prove existence of an optimal shape into a natural class of domains. We introduce a quasi-Newton type algorithm which moves the boundary. This method is very efficient to improve an initial shape. We give some numerical results.
Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming
The smoothing-type algorithm is a powerful tool for solving the second-order cone programming (SOCP), which is in general designed based on a monotone line search. In this paper, we propose a smoothing-type algorithm for solving the SOCP with a non-monotone line search. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results are also reported which indicate...
Analysis of a prototypical multiscale method coupling atomistic and continuum mechanics
In order to describe a solid which deforms smoothly in some region, but non smoothly in some other region, many multiscale methods have recently been proposed. They aim at coupling an atomistic model (discrete mechanics) with a macroscopic model (continuum mechanics). We provide here a theoretical ground for such a coupling in a one-dimensional setting. We briefly study the general case of a convex energy, and next concentrate on a specific example of a nonconvex energy, the Lennard-Jones case....
Analysis of a prototypical multiscale method coupling atomistic and continuum mechanics
In order to describe a solid which deforms smoothly in some region, but non smoothly in some other region, many multiscale methods have recently been proposed. They aim at coupling an atomistic model (discrete mechanics) with a macroscopic model (continuum mechanics). We provide here a theoretical ground for such a coupling in a one-dimensional setting. We briefly study the general case of a convex energy, and next concentrate on a specific example of a nonconvex energy, the Lennard-Jones case....
Analysis of approximate solutions of coupled dynamical thermoelasticity and related problems
The authors study problems of existence and uniqueness of solutions of various variational formulations of the coupled problem of dynamical thermoelasticity and of the convergence of approximate solutions of these problems. First, the semidiscrete approximate solutions is defined, which is obtained by time discretization of the original variational problem by Euler’s backward formula. Under certain smoothness assumptions on the date authors prove existence and uniqueness of the solution and establish...
Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization.
Anmerkungen zu einem Mehrgitterverfahren für lineare Komplementaritätsprobleme.
Application des sentinelles à l'identification des pollutions dans une rivière