Exact barrier function methods for Lipschitz programs
type: Item
instance of: scholarly article
title: Exact barrier function methods for Lipschitz programs
zbMATH Open document ID: 0837.90108
DOI: 10.1007/BF01189901
author: Gianni Di Pillo
author: Francisco Facchinei
published in: Applied Mathematics and Optimization
publication date: 1995-08-13T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 784118
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: nondifferentiable penalty functions
zbMATH Keywords: constrained Lipschitz programs
zbMATH Keywords: extended stationary point
zbMATH Keywords: convergence properties
MaRDI profile type: Publication
cites work: Sufficient conditions for a globally exact penalty function without convexity
cites work: Necessary and sufficient conditions for a penalty method to be exact
cites work: Q3690580
cites work: Stability and regular points of inequality systems
cites work: A sequential quadratic programming method for potentially infeasible mathematical programs
cites work: Calmness and Exact Penalization
cites work: An Exact Penalization Viewpoint of Constrained Optimization
cites work: A Robust Trust Region Method for Constrained Nonlinear Programming Problems
cites work: A robust sequential quadratic programming method
cites work: A lower bound for the controlling parameters of the exact penalty functions
cites work: On conditions for optimality of a class of nondifferentiable functions
cites work: Optimization and nonsmooth analysis
cites work: Q3972960
cites work: Regularity conditions and exact penalty functions in Lipschitz programming problems
cites work: An exact penalty function method with global convergence properties for nonlinear programming problems
cites work: On the exactness of a class of nondifferentiable penalty functions
cites work: Exact Penalty Functions in Constrained Optimization
cites work: A smooth method for the finite minimax problem
cites work: Exact penalty functions in nonlinear programming
cites work: Exact penalty functions and Lagrange multipliers
cites work: Refinements of necessary conditions for optimality in nonlinear programming
cites work: Q5588268
cites work: Q4226179
cites work: A globally convergent method for nonlinear programming
cites work: Refinements of necessary optimality conditions in nondifferentiable programming II
cites work: New Conditions for Exactness of a Simple Penalty Function
cites work: Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
cites work: Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
cites work: Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
cites work: On conditions to have bounded multipliers in locally lipschitz programming
cites work: An Exact Potential Method for Constrained Maxima
cites work: The potential method for conditional maxima in the locally compact metric spaces
cites work: On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
cites work: Convex Analysis
cites work: Exact penalty functions and stability in locally Lipschitz programming
cites work: Q3703595
cites work: Exact penalties and sufficient conditions for optimality in nonsmooth optimization
cites work: Nonsmooth Calculus in Finite Dimensions
cites work: Non-Linear Programming Via Penalty Functions
description: scientific article; zbMATH DE number 784118