See this document in CiteSeerX!

Coupling The Auxiliary Problem Principle With Descent Methods Of Pseudoconvex Programming (1998)  (Make Corrections)  (3 citations)
Daoli Zhu, Patrice Marcotte



  Home/Search   Context   Related

 
View or download:
iro.umontreal.ca/~marcot...modaux.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  iro.umontreal.ca/~marcott...publi (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The descent auxiliary problem method allows one to find the solution of minimization problems by solving a sequence of auxiliary problems which incorporate a linesearch strategy. We derive the basic algorithm and study its convergence properties within the framework of infinite dimensional pseudoconvex minimization. We also introduce a partial descent type auxiliary problem method which partially linearizes the objective functional and includes the auxiliary term only for of subset of... (Update)

Context of citations to this paper:   More

.... convergence analyses are, in all cases, more limited and weaker than ours; examples of such frameworks include those in [DFL86, LaM90, Tse91, Mig94, ZhM95]. Applications of the convergence analysis of the CA method to differentiable optimization can be found in [Pat93b, Pat93c]...

.... s modified projection method [7] the general descent method of Zhu and Marcotte [17] and the auxiliary principle descent method [2] [16]. The first three of these methods have so far been only proposed for finite dimensional spaces. The remainder of the paper will address the...

Cited by:   More
Decentralizing Semiconductor Capacity Planning Via Internal.. - Karabuk, WU   (Correct)
Convergence Properties of Feasible Descent Algorithms for.. - Marcotte, Zhu (1997)   (Correct)
Cost approximation: A unified framework of descent algorithms.. - Patriksson (1997)   (Correct)

Active bibliography (related documents):   More   All
0.5:   A Taxonomy of Descent Algorithms for Nonlinear Programs and.. - Patriksson (1994)   (Correct)
0.5:   Cost Approximation Algorithms - Patriksson   (Correct)
0.4:   A Unified Description of Iterative Algorithms for Traffic.. - Patriksson (1992)   (Correct)

Similar documents based on text:   More   All
0.3:   Conditions Ensuring the Applicability of Cutting-Plane.. - Crouzeix, Marcotte, Zhu (1999)   (Correct)
0.3:   The Computer Calculation of Lie Point Symmetries of.. - Champagne, Hereman.. (1990)   (Correct)
0.3:   Concavity Cuts for Disjoint Bilinear Programming - Alarie, Audet, al. (1999)   (Correct)

Related documents from co-citation:   More   All
2:   Decomposition-coordination methods in large scale optimization problems: the non.. (context) - Cohen, Zhu - 1984
2:   Introduction to Optimization (context) - Polyak - 1987
2:   A class of gap functions for variational inequalities - Larsson, Patriksson - 1994

BibTeX entry:   (Update)

D. Zhu and P. Marcotte, Coupling the auxiliary problem principle with descent methods of pseudoconvex programming, European J. Oper. Res., 83 (1995), pp. 670--685. http://citeseer.ist.psu.edu/zhu98coupling.html   More

@misc{ zhu95coupling,
  author = "D. Zhu and P. Marcotte",
  title = "Coupling the auxiliary problem principle with descent methods of pseudoconvex
    programming",
  text = "D. Zhu and P. Marcotte, Coupling the auxiliary problem principle with descent
    methods of pseudoconvex programming, European J. Oper. Res., 83 (1995),
    pp. 670--685.",
  year = "1995",
  url = "citeseer.ist.psu.edu/zhu98coupling.html" }
Citations (may not include all citations):
482   Iterative solution of nonlinear equations in several Variabl.. (context) - Ortega - 1970
62   Augmented Lagrangians and applications of the proximal point.. (context) - Rockafellar - 1976
55   Optimization theory for large systems (context) - Lasdon - 1970
35   the Goldstein-Levitin-Polyak gradient projection method (context) - Bertsekas - 1976
18   Network design problem with congestion effects: a case of bi.. (context) - Marcotte - 1986
14   the convergence of the proximal point algorithm for convex m.. (context) - On - 1991
14   North-Holland Publishing Company (context) - Ekeland, Temam - 1970
14   Auxiliary problem principle and decomposition of optimizatio.. (context) - Cohen - 1980
10   Linearized simplicial decomposition methods for computing tr.. (context) - Pang - 1982
9   Optimization by decomposition and coordination: a unified ap.. (context) - Cohen - 1978
9   The convergence of equilibrium algorithms with predetermined.. (context) - Powell, Sheffi - 1982
8   An algorithm for nonlinear programs over Cartesian product s.. (context) - Larsson, Migdalas - 1990
8   Decomposition coordination methods in large scale problems: .. (context) - Cohen, Zhu - 1984
5   Computing equilibria on large multicommodity networks: an ap.. (context) - Dembo, Tulowitzki - 1988
5   An extended descent framework for monotone variational inequ.. (context) - Marcotte - 1994
4   Global convergence of descent processes for solving non stri.. - Marcotte - 1992
1   A generalization of the proximal point algorithm for convex .. (context) - Cu - 1990
1   Nonlinear Programming (context) - Martos - 1975
1   Numerical methods in extremal problems (context) - Pschenichny, Danilin - 1978
1   North-Holland Publishing Company (context) - Avriel, Diwert et al. - 1988
1   Optimisation sous-diff'erentiable et m'ethodes de d'ecomposi.. (context) - Zhu - 1982

Documents on the same site (http://www.iro.umontreal.ca/~marcotte/publi.html):   More
Modified Descent Methods for Solving the Monotone Variational.. - Zhu, Marcotte (1998)   (Correct)
New Classes of Generalized Monotonicity - Zhu, Marcotte (1995)   (Correct)
Co-Coercivity And Its Role In The Convergence Of Iterative.. - Zhu And (1992)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC