Exact barrier function methods for Lipschitz programs

DOI10.1007/BF01189901zbMath0837.90108MaRDI QIDQ1895790

Francisco Facchinei, Gianni Di Pillo

Publication date: 13 August 1995

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

nonsmooth optimizationconvergence propertiesnondifferentiable penalty functionsconstrained Lipschitz programsextended stationary point

Mathematics Subject Classification ID

Related Items (10)

A class of augmented Lagrangians for equality constraints in nonlinear programming problems ⋮ Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ A filled function method applied to nonsmooth constrained global optimization ⋮ Error bounds in mathematical programming ⋮ Exact Penalization of Generalized Nash Equilibrium Problems ⋮ A convergence analysis of the method of codifferential descent ⋮ An approach to constrained global optimization based on exact penalty functions ⋮ Exact penalization via dini and hadamard conditional derivatives ⋮ Constraint incorporation in optimization ⋮ A unifying theory of exactness of linear penalty functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smooth method for the finite minimax problem
• Stability and regular points of inequality systems
• On conditions for optimality of a class of nondifferentiable functions
• On the exactness of a class of nondifferentiable penalty functions
• Exact penalties and sufficient conditions for optimality in nonsmooth optimization
• A globally convergent method for nonlinear programming
• Refinements of necessary conditions for optimality in nonlinear programming
• A robust sequential quadratic programming method
• The potential method for conditional maxima in the locally compact metric spaces
• A sequential quadratic programming method for potentially infeasible mathematical programs
• Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
• Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
• Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
• Exact penalty functions and Lagrange multipliers
• Calmness and Exact Penalization
• Optimization and nonsmooth analysis
• Exact penalty functions and stability in locally Lipschitz programming
• An exact penalty function method with global convergence properties for nonlinear programming problems
• Nonsmooth Calculus in Finite Dimensions
• Exact penalty functions in nonlinear programming
• On conditions to have bounded multipliers in locally lipschitz programming
• Sufficient conditions for a globally exact penalty function without convexity
• On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
• An Exact Penalization Viewpoint of Constrained Optimization
• A Robust Trust Region Method for Constrained Nonlinear Programming Problems
• Necessary and sufficient conditions for a penalty method to be exact
• A lower bound for the controlling parameters of the exact penalty functions
• Exact Penalty Functions in Constrained Optimization
• Refinements of necessary optimality conditions in nondifferentiable programming II
• Non-Linear Programming Via Penalty Functions
• An Exact Potential Method for Constrained Maxima
• Convex Analysis
• New Conditions for Exactness of a Simple Penalty Function
• Exact penalty functions in nonlinear programming

This page was built for publication: Exact barrier function methods for Lipschitz programs