On the public citation graph

Exact barrier function methods for Lipschitz programs

https://doi.org/10.1007/bf01189901
0 signed · 64 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118723203openalex-snapshot
Practical Methods of Optimization
inferredcites →https://doi.org/10.1007/978-1-4757-6019-4_7openalex-snapshot
Exact Penalty Functions for Nondifferentiable Programming Problems
inferredcites →https://doi.org/10.1007/978-3-642-82450-0_6openalex-snapshot
Principles of Sequential Quadratic Programming Methods for Solving Nonlinear Programs
inferredcites →https://doi.org/10.1007/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bf00934750openalex-snapshot
On conditions for optimality of a class of nondifferentiable functions
inferredcites →https://doi.org/10.1007/bf00938588openalex-snapshot
Stability and regular points of inequality systems
inferredcites →https://doi.org/10.1007/bf00940078openalex-snapshot
Refinements of necessary conditions for optimality in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01442544openalex-snapshot
Refinements of necessary optimality conditions in nondifferentiable programming I
inferredcites →https://doi.org/10.1007/bf01580609openalex-snapshot
A smooth method for the finite minimax problem
inferredcites →https://doi.org/10.1007/bf01582294openalex-snapshot
A robust sequential quadratic programming method
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588302openalex-snapshot
On conditions to have bounded multipliers in locally lipschitz programming
inferredcites →https://doi.org/10.1007/bf01609033openalex-snapshot
A lower bound for the controlling parameters of the exact penalty functions
inferredcites →https://doi.org/10.1007/bf01681332openalex-snapshot
Necessary and sufficient conditions for a penalty method to be exact
inferredcites →https://doi.org/10.1007/bf02165588openalex-snapshot
The potential method for conditional maxima in the locally compact metric spaces
inferredcites →https://doi.org/10.1007/bf02346160openalex-snapshot
On the exactness of a class of nondifferentiable penalty functions
inferredcites →https://doi.org/10.1007/bf02346165openalex-snapshot
Exact penalties and sufficient conditions for optimality in nonsmooth optimization
inferredcites →https://doi.org/10.1007/bf02591938openalex-snapshot
Exact penalty functions and stability in locally Lipschitz programming
inferredcites →https://doi.org/10.1007/bf02591986openalex-snapshot
An exact penalty function method with global convergence properties for nonlinear programming problems
inferredcites →https://doi.org/10.1007/bfb0120980openalex-snapshot
Sufficient conditions for a globally exact penalty function without convexity
inferredcites →https://doi.org/10.1007/bfb0120985openalex-snapshot
Refinements of necessary optimality conditions in nondifferentiable programming II
inferredcites →https://doi.org/10.1016/0022-247x(89)90111-xopenalex-snapshot
A sequential quadratic programming method for potentially infeasible mathematical programs
inferredcites →https://doi.org/10.1016/0378-4754(88)90129-2openalex-snapshot
Practical methods of optimization
inferredcites →https://doi.org/10.1080/02331939108843701openalex-snapshot
Exact penalty functions and Lagrange multipliers
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0311029openalex-snapshot
New Conditions for Exactness of a Simple Penalty Function
inferredcites →https://doi.org/10.1137/0317019openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
inferredcites →https://doi.org/10.1137/0317020openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
inferredcites →https://doi.org/10.1137/0317021openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
inferredcites →https://doi.org/10.1137/0321010openalex-snapshot
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
inferredcites →https://doi.org/10.1137/0325072openalex-snapshot
Nonsmooth Calculus in Finite Dimensions
inferredcites →https://doi.org/10.1137/0327068openalex-snapshot
Exact Penalty Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/0329027openalex-snapshot
Calmness and Exact Penalization
inferredcites →https://doi.org/10.1137/0329054openalex-snapshot
An Exact Penalization Viewpoint of Constrained Optimization
inferredcites →https://doi.org/10.1137/0706028openalex-snapshot
An Exact Potential Method for Constrained Maxima
inferredcites →https://doi.org/10.1137/0802016openalex-snapshot
A Robust Trust Region Method for Constrained Nonlinear Programming Problems
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/2008742openalex-snapshot
Practical Methods of Optimization.
inferredcites →https://doi.org/10.4324/9781003580447-10openalex-snapshot
Regularity Conditions and Exact Penalty Functions in Lipschitz Programming Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/oca.2530openalex-snapshot
Exact penalty functions for optimal control problems I: Main theorem and free‐endpoint problems
inferred← citeshttps://doi.org/10.1002/oca.2577openalex-snapshot
Exact penalty functions for optimal control problems II: Exact penalization of terminal and pointwise state constraints
inferred← citeshttps://doi.org/10.1007/0-387-30065-1_8openalex-snapshot
Exact penalty functions for generalized Nash problems
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_8openalex-snapshot
Exact Penalty Methods
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/s10107-006-0016-1openalex-snapshot
Constraint incorporation in optimization
inferred← citeshttps://doi.org/10.1007/s10589-018-0024-0openalex-snapshot
A convergence analysis of the method of codifferential descent
inferred← citeshttps://doi.org/10.1007/s10589-022-00363-1openalex-snapshot
Derivative-free methods for mixed-integer nonsmooth constrained optimization
inferred← citeshttps://doi.org/10.1007/s10898-010-9582-0openalex-snapshot
An approach to constrained global optimization based on exact penalty functions
inferred← citeshttps://doi.org/10.1007/s10957-018-1238-0openalex-snapshot
A Unified Approach to the Global Exactness of Penalty and Augmented Lagrangian Functions I: Parametric Exactness
inferred← citeshttps://doi.org/10.1016/j.cam.2009.06.020openalex-snapshot
A filled function method applied to nonsmooth constrained global optimization
inferred← citeshttps://doi.org/10.1080/01630563.2017.1338732openalex-snapshot
Algorithm of Barrier Objective Penalty Function
inferred← citeshttps://doi.org/10.1080/02331934.2015.1122005openalex-snapshot
A unifying theory of exactness of linear penalty functions
inferred← citeshttps://doi.org/10.1080/02331934.2017.1349125openalex-snapshot
A unifying theory of exactness of linear penalty functions II: parametric penalty functions
inferred← citeshttps://doi.org/10.1080/02331934.2022.2157678openalex-snapshot
Exact augmented Lagrangians for constrained optimization problems in Hilbert spaces I: theory
inferred← citeshttps://doi.org/10.1080/10556789808805684openalex-snapshot
Exact penalization via dini and hadamard conditional derivatives
inferred← citeshttps://doi.org/10.1109/tste.2016.2608279openalex-snapshot
Model Predictive Control of Energy Storage Systems for Power Tracking and Shaving in Distribution Grids
inferred← citeshttps://doi.org/10.1137/090749499openalex-snapshot
Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
inferred← citeshttps://doi.org/10.1137/130940037openalex-snapshot
A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1137/s0363012996301269openalex-snapshot
Weak Sharp Minima: Characterizations and Sufficient Conditions
inferred← citeshttps://doi.org/10.1287/moor.1050.0153openalex-snapshot
Convergence of Successive Approximation Methods with Parameter Target Sets
inferred← citeshttps://doi.org/10.1287/opre.2019.1942openalex-snapshot
Exact Penalization of Generalized Nash Equilibrium Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.