Image segmentation with a finite element method
Image segmentation with a finite element method
The Mumford-Shah functional for image segmentation is an original approach of the image segmentation problem, based on a minimal energy criterion. Its minimization can be seen as a free discontinuity problem and is based on Γ-convergence and bounded variation functions theories. Some new regularization results, make possible to imagine a finite element resolution method. In a first time, the Mumford-Shah functional is introduced and some existing results are quoted. Then, a discrete formulation...
Imperfect Conjugate Gradient Algorithms for Extended Quadratic Functions.
Implementació d'un algorisme primal-dual de un punt interior amb fites superiors a les variables.
Implémentation des méthodes d'optimisation : test d'arrêt optimal, contrôle et précision de la solution
Implémentation des méthodes d'optimisation : test d'arrêt optimal, contrôle et précision de la solution (II)
Improved local convergence analysis of inexact Newton-like methods under the majorant condition
We present a local convergence analysis of inexact Newton-like methods for solving nonlinear equations. Using more precise majorant conditions than in earlier studies, we provide: a larger radius of convergence; tighter error estimates on the distances involved; and a clearer relationship between the majorant function and the associated least squares problem. Moreover, these advantages are obtained under the same computational cost.
Inequality-based approximation of matrix eigenvectors
A novel procedure is given here for constructing non-negative functions with zero-valued global minima coinciding with eigenvectors of a general real matrix A. Some of these functions are distinct because all their local minima are also global, offering a new way of determining eigenpairs by local optimization. Apart from describing the framework of the method, the error bounds given separately for the approximation of eigenvectors and eigenvalues provide a deeper insight into the fundamentally...
Inequality-sum : a global constraint capturing the objective function
This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum , and where the integer variables are subject to difference constraints of the form . An important application area where such problems occur is deterministic scheduling with the mean flow time as optimality criteria. This new constraint is also more general than a sum constraint defined on a set of ordered variables. Classical approaches...
Inequality-sum: a global constraint capturing the objective function
This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum y = ∑xi, and where the integer variables xi are subject to difference constraints of the form xj - xi ≤ c. An important application area where such problems occur is deterministic scheduling with the mean flow time as optimality criteria. This new constraint is also more general than a sum constraint defined on a set of ordered variables....
Inexact solution of auxiliary problems in Polyak type algorithms
Inexact trust region method for large sparse nonlinear least squares
Integer Programming Formulation of the Bilevel Knapsack Problem
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that the...
Internal approximation of quasi-variational inequalities.
Interval linear regression analysis based on Minkowski difference – a bridge between traditional and interval linear regression models
In this paper, we extend the traditional linear regression methods to the (numerical input)-(interval output) data case assuming both the observation/measurement error and the indeterminacy of the input-output relationship. We propose three different models based on three different assumptions of interval output data. In each model, the errors are defined as intervals by solving the interval equation representing the relationship among the interval output, the interval function and the interval...
Inverse coefficient problems for variational inequalities : optimality conditions and numerical realization
We consider the identification of a distributed parameter in an elliptic variational inequality. On the basis of an optimal control problem formulation, the application of a primal-dual penalization technique enables us to prove the existence of multipliers giving a first order characterization of the optimal solution. Concerning the parameter we consider different regularity requirements. For the numerical realization we utilize a complementarity function, which allows us to rewrite the optimality...
Inverse Coefficient Problems for Variational Inequalities: Optimality Conditions and Numerical Realization
We consider the identification of a distributed parameter in an elliptic variational inequality. On the basis of an optimal control problem formulation, the application of a primal-dual penalization technique enables us to prove the existence of multipliers giving a first order characterization of the optimal solution. Concerning the parameter we consider different regularity requirements. For the numerical realization we utilize a complementarity function, which allows us to rewrite the optimality...
Inverse problem in engineering plasticity: a quadratic programming approach
Si considera un modello discreto (per elementi finiti) di un solido o un sistema strutturale perfettamente elastoplastico, con condizioni di snervamento «linearizzate a tratti», nell’ipotesi di olonomia assunta per processi di caricamento proporzionali. Supponendo noti su base sperimentale certi spostamenti sotto assegnate azioni esterne, si formula il problema di identificare i limiti di snervamento, ossia le resistenze locali. Si dimostra che questo problema inverso di meccanica strutturale non...
Investment/financial planning with endogenous lifetimes : a heuristic approach to mixed-integer programming
Iterative algorithm for solving mixed quasi-variational-like inequalities with skew-symmetric terms in Banach spaces.