Bibliographic record and links to related information available from the Library of Congress catalog

Information from electronic data provided by the publisher. May be incomplete or contain other coding.

Preface. Generalized Lagrange multipliers: regularity and boundedness; G. Bigi, M. Pappalardo. A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints; A.R. Conn, et al. Minimal convexificators of a positively homogeneous function and a characterization of its convexity and concavity; V.F. Demyanov. Optimal control problems and penalization; V.F. Demyanov, et al. A truncated Newton method for constrained optimization; G. Di Pillo, et al. Fixed and virtual stability center methods for convex nonsmooth minimization; A. Fuduli, M. Gaudioso. Iterative methods for ill-conditioned linear systems from optimization; N.I.M. Gould. An algorithm for solving nonlinear programs with noisy inequality constraints; M. Hintermüller. Generic existence uniqueness and stability in optimization problems; A. Ioffe, R. Lucchetti. On a class of bilevel programs; M. Labbé, et al. Separation methods for vector variational inequalities. Saddle point and gap function; G. Mastroeni. Functions with primal-dual gradient structure and U-Hessians; R. Mifflin, C. Sagastizábal. Quadratic and multidimensional assignment problems; P.M. Pardalos, L.S. Pitsoulis. A new merit function and an SQP method for non-strictly monotone variational inequalities; M. Patriksson. A logarithmic barrier approach to Fischer function; J. Peng, et al. On an approach to optimization problems with a probabilistic cost and or constraints; E. Polak, et al. Semiderivative functions and reformulation methods for solving complementarity and variational inequality problems; L. Qi, et al. Global Lagrange multiplier rule and smooth exact penalty functions for equality constraints; T. Rapcsák. Structural methods in the solution of variational inequalities; S.M. Robinson. Extended nonlinear programming; R.T. Rockafellar. On the efficiency of splitting and projection methods for large strictly convex quadratic programs; V. Ruggiero, L. Zanni. A comparison of rates of convergence of two inexact proximal point algorithms; M.V. Solodov, et al. One way to construct a global search algorithm for d. c. minimization problems; A.S. Strekalovsky. Error bounds and superlinear convergence analysis of some Newton-type methods in optimization; P. Tseng. A new derivative-free descent method for the nonlinear complementarity problem; K. Yamada, et al.

Library of Congress subject headings for this publication:

Mathematical optimization -- Congresses.

Nonlinear theories -- Congresses.