Abstract
In 1983, J.E. Spingarn introduced what he called the Partial Inverse Method in the framework of Mathematical Programming. Since his initial articles, numerous applications have been given in various fields including Lagrangian multipliers methods, location theory, convex feasibility problems, analysis of data, economic equilibrium problems. In a first part of this paper we give a survey of these applications. Then by means of optimization problems relevant to location theory such as single and multifacility minimisum or minimax location problems, we examine the main advantages of the algorithm and we point out its drawbacks mainly concerning the rate of convergence. We study how different parameters can be introduced to get a significant reduction in the number of iterations and we give numerical results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boughazi, M., Pham Dinh, Tao, Un algorithme primal-dual pour le calcul du minimum d'une fonction convexe sur une intersection de convexes et ses applications en analyse de données, RR 638-M, IMAG, Grenoble (1987).
Chatelon, J., Hearn, D., Lowe, T. J., A subgradient algorithm for certain minimax and minisum problems — the constrained case, SIAM Journal on Control and Optimization 20 (1982), 455–469.
Drezner, Z., Shelah, S., On the complexity of the Elzinga-Hearn algorithm for the 1-center problem, Mathematics of Operations Research, 12 (1987), 255–261.
Drezner, Z., Wesolowsky, G. O., Single facility lp-distances minimax location, SIAM Journal on Algebraic and Discrete Methods, 1 (1980), 315–321.
Elzinga, J., Hearn, D. W., Geometrical solutions for some minimax location problems, Transportation Science, 6 (1972), 379–394.
Idrissi, H., Lefebvre, O., Michelot, C., A primal dual algorithm for a constrained Fermat-Weber problem involving mixed norms, RAIRO Recherche Opérationnelle, 22 (1988), 313–330.
Idrissi, H., Lefebvre, O., Michelot, C., Duality for constrained multifacility location problems with mixed norms and applications, Annals of Operations Research, (1989), to appear.
Lawrence, J., Spingarn, J. E., On fixed points of nonexpansive piecewise isometric mappings, Proceedings of the London Mathematical Society, 55 (1987), 605–624.
Lefebvre, O., Michelot, C., Calcul d'un point fixe d'une application prox par la méthode des approximations successives; conditions de convergence finie, Comptes Rendus de l'Académie des Sciences de Paris, t. 303, Série I, no17 (1986), 905–908.
Lefebvre, O., Michelot, C., About the finite convergence of the proximal point algorithm, International Series of Numerical Mathematics, 84, Birkhauser Verlag, 1988, 153–161.
Lefebvre, O., Michelot, C., Plastria, F., Geometric interpretation of the optimality conditions in multifacility location and applications, Journal of Optimization Theory and Applications, (1989), to appear.
Lemaire, B., The proximal algorithm, International Series of Numerical Mathematics, to appear.
Luque, F. J., Asymptotic convergence analysis of the proximal point algorithm, SIAM Journal on Control and Optimization, 22 (1984), 277–293.
Martinet, B., Régularisation d'inéquations variationnelles par approximations successives, Revue Française d'Informatique et Recherche Opérationnelle, (1970), 154–159.
Martinet, B., Détermination approchée d'un point fixe d'une application pseudocontractante, Comptes Rendus de l'Académie des Sciences de Paris, 274 (1972), 163–165.
Megiddo, N., The weighted Euclidean 1-center problem, Mathematics of Operations Research, 8 (1983), 498–504.
Michelot, C., Lefebvre, O., A primal dual algorithm for the Fermat-Weber problem involving mixed gauges, Mathematical Programming, 39 (1987), 319–335.
Opial, Z., Weak convergence of the successive approximations for nonexpansive mapping in Banach spaces, Bulletin of the American Mathematical Society, 73 (1967), 591–597.
Rockafellar, R. T., Convex Analysis, Princeton University Press, Princeton, N.J., 1970.
Rockafellar, R. T., Monotone operators and the proximal point algorithm, SIAM Journal on Control and Optimization, 14 (1976), 877–898.
Rockafellar, R. T., Network Flows and Monotropic Optimization, J. Wiley, New York, 1984.
Spingarn, J. E., Partial inverse of a monotone operator, Applied Mathematics and Optimization, 10 (1983), 247–265.
Spingarn, J. E., A primal-dual projection method for solving systems of linear inequalities, Linear Algebra and its Applications, 65 (1985), 45–62.
Spingarn, J. E., Applications of the method of partial inverses to convex programming: decomposition, Mathematical Programming, 32 (1985), 199–223.
Spingarn, J. E., A projection method for least-squares solutions of overdetermined systems of linear inequalities, Linear Algebra and its Applications, 86 (1987), 221–236.
Spingarn, J. E., On computation of spatial economic equilibria, CORE discussion paper 8731 (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer Verlag
About this paper
Cite this paper
Idrissi, H., Lefebvre, O., Michelot, C. (1989). Applications and numerical convergence of the partial inverse method. In: Dolecki, S. (eds) Optimization. Lecture Notes in Mathematics, vol 1405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083585
Download citation
DOI: https://doi.org/10.1007/BFb0083585
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51970-6
Online ISBN: 978-3-540-46867-7
eBook Packages: Springer Book Archive