Global convergence of a class of smooth penalty methods for semi-infinite programming
type: Item
instance of: scholarly article
title: Global convergence of a class of smooth penalty methods for semi-infinite programming
zbMATH Open document ID: 1282.90207
author: Yanyan Li
published in: Journal of Systems Science and Complexity
publication date: 2013-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6133206
zbMATH Keywords: global convergence
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: smooth penalty function
zbMATH Keywords: perturbation function
MaRDI profile type: Publication
full work available at URL: s11424-011-8427-3
OpenAlex ID: W2042983501
cites work: Weak Sharp Minima in Mathematical Programming
cites work: Smoothing methods for convex inequalities and linear complementarity problems
cites work: Q3873909
cites work: Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
cites work: A note on an implementation of a method for quadratic semi-infinite programming
cites work: A smoothing Newton method for semi-infinite programming
cites work: Global convergence of a robust smoothing SQP method for semi-infinite programming
cites work: A perturbation method for solving linear semi-infinite programming problems
cites work: Penalty and Barrier Methods: A Unified Framework
cites work: Numerical experiments in semi-infinite programming
cites work: Globally convergent methods for semi-infinite programming
cites work: Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
cites work: On Smoothing Exact Penalty Functions for Convex Constrained Optimization
cites work: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
cites work: A nonlinear programming algorithm based on non-coercive penalty functions
cites work: Non-Linear Programming Via Penalty Functions
cites work: Semismooth Newton methods for solving semi-infinite programming problems
cites work: On the numerical treatment of linearly constrained semi-infinite optimization problems
cites work: Discretization methods for the solution of semi-infinite programming problems
cites work: An iterative method for solving KKT system of the semi-infinite programming
DOI: 10.1007/S11424-011-8427-3
description: scientific article; zbMATH DE number 6133206