Computational experience with improved conjugate gradient methods for unconstrained minimization
Computational experience with improved variable metric methods for unconstrained minimization
Computational experiments with some approximation algorithms for the travelling salesman problem
Computational modelling of thermal consumption of buildings with controlled interior temperature
New materials, structures and technologies used in civil engineering impeach traditional evaluations of the annual thermal consumption of buildings, based on the quasi-stationary estimate of the thermal resistance of the building envelope, or some operational parts of such building with the guaranteed temperature. The complete proper physical analysis, applying the principles of thermodynamics and appropriate constitutive relations for particular material layers and air in rooms, is not realistic...
Computational simulation of vortex phenomena in superconductors.
Conditioning and error estimates in LQG design
Conditions de régularité géométrique pour les inéquations variationnelles
Conformal Mappings onto Prescribed Regions via Optimization Techniques.
Conjugate direction algorithms for extended conic functions
Conjugate gradient algorithms for conic functions
The paper contains a description and an analysis of two modifications of the conjugate gradient method for unconstrained minimization which find a minimum of the conic function after a finite number of steps. Moreover, further extension of the conjugate gradient method is given which is based on a more general class of the model functions.
Conservation law constrained optimization based upon front-tracking
We consider models based on conservation laws. For the optimization of such systems, a sensitivity analysis is essential to determine how changes in the decision variables influence the objective function. Here we study the sensitivity with respect to the initial data of objective functions that depend upon the solution of Riemann problems with piecewise linear flux functions. We present representations for the one–sided directional derivatives of the objective functions. The results can be used...
Conservation law constrained optimization based upon Front-Tracking
We consider models based on conservation laws. For the optimization of such systems, a sensitivity analysis is essential to determine how changes in the decision variables influence the objective function. Here we study the sensitivity with respect to the initial data of objective functions that depend upon the solution of Riemann problems with piecewise linear flux functions. We present representations for the one–sided directional derivatives of the objective functions. The results can be used...
Constrained optimization: A general tolerance approach
To overcome the somewhat artificial difficulties in classical optimization theory concerning the existence and stability of minimizers, a new setting of constrained optimization problems (called problems with tolerance) is proposed using given proximity structures to define the neighbourhoods of sets. The infimum and the so-called minimizing filter are then defined by means of level sets created by these neighbourhoods, which also reflects the engineering approach to constrained optimization problems....
Constrained optimization via unconstrained minimization
Construction and features of the optimum rational function used in the ADI-method
Contact shape optimization based on the reciprocal variational formulation
The paper deals with a class of optimal shape design problems for elastic bodies unilaterally supported by a rigid foundation. Cost and constraint functionals defining the problem depend on contact stresses, i.e. their control is of primal interest. To this end, the so-called reciprocal variational formulation of contact problems making it possible to approximate directly the contact stresses is used. The existence and approximation results are established. The sensitivity analysis is carried out....
Continuous limits of discrete perimeters
We consider a class of discrete convex functionals which satisfy a (generalized) coarea formula. These functionals, based on submodular interactions, arise in discrete optimization and are known as a large class of problems which can be solved in polynomial time. In particular, some of them can be solved very efficiently by maximal flow algorithms and are quite popular in the image processing community. We study the limit in the continuum of these functionals, show that they always converge...
Control variational method approach to bending and contact problems for Gao beam
This paper deals with a nonlinear beam model which was published by D. Y. Gao in 1996. It is considered either pure bending or a unilateral contact with elastic foundation, where the normal compliance condition is employed. Under additional assumptions on data, higher regularity of solution is proved. It enables us to transform the problem into a control variational problem. For basic types of boundary conditions, suitable transformations of the problem are derived. The control variational problem...
Contrôle et amélioration de la précision numérique des codes de programmation linéaire continue
Control/fictitious domain method for solving optimal shape design problems