Mathematical theory of optimization

zbMath1039.90073MaRDI QIDQ5941763

Weili Wu, Ding-Zhu Du, Panos M. Pardalos

Publication date: 26 August 2001

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationnonlinear optimizationconvergence analysis of nonlinear optimization algorithmslocal optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Variational inequalities (49J40) Fixed-point theorems (47H10) Nonlinear elliptic equations (35J60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (21)

Second order duality for nondifferentiable minimax programming problems with generalized convexity ⋮ Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ Global convergence and the Powell singular function ⋮ Exactness and algorithm of an objective penalty function ⋮ Second-order duality for nondifferentiable minimax programming involving generalized type I functions ⋮ A descent extension of the Polak-Ribière-Polyak conjugate gradient method ⋮ CONSENSUS PROBLEMS IN WEIGHTED HIERARCHICAL GRAPHS ⋮ Levitin-Polyak well-posedness by perturbations of inverse variational inequalities ⋮ Globally optimal solutions of max-min systems ⋮ On the sufficient descent property of the Shanno's conjugate gradient method ⋮ Computer geometry and encoding the information on a manifold ⋮ Two modified three-term conjugate gradient methods with sufficient descent property ⋮ A globally and superlinearly convergent modified SQP-filter method ⋮ Conjugate gradient path method without line search technique for derivative-free unconstrained optimization ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ Localization of minimax points ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ Concave programming and DH-point ⋮ Necessary and sufficient conditions for emptiness of the cones of generalized support vectors ⋮ CONSENSUS ANALYSIS IN HIERARCHICAL NETWORKED SYSTEMS

This page was built for publication: Mathematical theory of optimization