A smoothing Newton method for semi-infinite programming
type: Item
instance of: scholarly article
title: A smoothing Newton method for semi-infinite programming
zbMATH Open document ID: 1066.90131
author: Liqun Qi
author: Judy Tam
author: Soon-Yi Wu
author: Dong-Hui Li
published in: Journal of Global Optimization
publication date: 2005-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 2168235
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: KKT conditions
zbMATH Keywords: semismooth equations
zbMATH Keywords: smoothing Newton method
describes a project that uses: FSQP
MaRDI profile type: MaRDI publication profile
full work available at URL: s10898-004-8266-z
OpenAlex ID: W1981417350
cites work: Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
cites work: Optimization and nonsmooth analysis
cites work: A projected lagrangian algorithm for semi-infinite programming
cites work: Q3840141
cites work: A semismooth equation approach to the solution of nonlinear complementarity problems
cites work: Solution of monotone complementarity problems with locally Lipschitzian functions
cites work: Local Convergence of SQP Methods in Semi-Infinite Programming
cites work: Q4161092
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Directional derivative of the marginal function in nonlinear programming
cites work: Jacobian Smoothing Methods for Nonlinear Complementarity Problems
cites work: Q3840142
cites work: Smoothing Newton and quasi-Newton methods for mixed complementarity problems
cites work: Q5589748
cites work: Nonsmooth Equations: Motivation and Algorithms
cites work: Optimization. Algorithms and consistent approximations
cites work: A recursive quadratic programming algorithm for semi-infinite optimization problems
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
cites work: Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems
cites work: Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
cites work: Q4946118
cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
cites work: A nonsmooth version of Newton's method
cites work: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
cites work: Semismooth Newton methods for solving semi-infinite programming problems
cites work: Q3840143
cites work: Second-order optimality conditions in generalized semi-infinite programming
cites work: Q3840140
cites work: A globally convergent SQP method for semi-infinite nonlinear optimization
cites work: Computational discretization algorithms for functional inequality constrained optimization
cites work: A penalty approach to iterative algorithms for envelope constrained filter design
cites work: Globally convergent methods for semi-infinite programming
cites work: A smoothing Gauss-Newton method for the generalized HLCP
cites work: Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
DOI: 10.1007/S10898-004-8266-Z
description: scientific article; zbMATH DE number 2168235