A globally convergent Newton method for convex SC1 minimization problems

J. S. Pang; Liqun Qi

doi:10.1007/BF02193060

A globally convergent Newton method for convex SC¹ minimization problems

J. S. Pang, Liqun Qi

Research output: Journal article publication › Journal article › Academic research › peer-review

52 Citations (Scopus)

Abstract

This paper presents a globally convergent and locally superlinearly convergent method for solving a convex minimization problem whose objective function has a semismooth but nondifferentiable gradient. Applications to nonlinear minimax problems, stochastic programs with recourse, and their extensions are discussed.

Original language	English
Pages (from-to)	633-648
Number of pages	16
Journal	Journal of Optimization Theory and Applications
Volume	85
Issue number	3
DOIs	https://doi.org/10.1007/BF02193060
Publication status	Published - 1 Jun 1995
Externally published	Yes

Keywords

Newton method
Nonsmooth optimization

ASJC Scopus subject areas

Control and Optimization
Management Science and Operations Research
Applied Mathematics

More information

10.1007/BF02193060

Cite this

@article{2127f0d439cb485b8445ad68e74d5ce0,

title = "A globally convergent Newton method for convex SC1 minimization problems",

abstract = "This paper presents a globally convergent and locally superlinearly convergent method for solving a convex minimization problem whose objective function has a semismooth but nondifferentiable gradient. Applications to nonlinear minimax problems, stochastic programs with recourse, and their extensions are discussed.",

keywords = "Newton method, Nonsmooth optimization",

author = "Pang, {J. S.} and Liqun Qi",

year = "1995",

month = jun,

day = "1",

doi = "10.1007/BF02193060",

language = "English",

volume = "85",

pages = "633--648",

journal = "Journal of Optimization Theory and Applications",

issn = "0022-3239",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - A globally convergent Newton method for convex SC1 minimization problems

AU - Pang, J. S.

AU - Qi, Liqun

PY - 1995/6/1

Y1 - 1995/6/1

N2 - This paper presents a globally convergent and locally superlinearly convergent method for solving a convex minimization problem whose objective function has a semismooth but nondifferentiable gradient. Applications to nonlinear minimax problems, stochastic programs with recourse, and their extensions are discussed.

AB - This paper presents a globally convergent and locally superlinearly convergent method for solving a convex minimization problem whose objective function has a semismooth but nondifferentiable gradient. Applications to nonlinear minimax problems, stochastic programs with recourse, and their extensions are discussed.

KW - Newton method

KW - Nonsmooth optimization

UR - http://www.scopus.com/inward/record.url?scp=21844494543&partnerID=8YFLogxK

U2 - 10.1007/BF02193060

DO - 10.1007/BF02193060

M3 - Journal article

SN - 0022-3239

VL - 85

SP - 633

EP - 648

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

IS - 3

ER -