On the public citation graph
Exact penalty functions and stability in locally Lipschitz programming
0 signed · 84 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bf01071427openalex-snapshot
Convex programming in a normalized space
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/bf01588951openalex-snapshot
On optimality conditions in nondifferentiable 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/bf02594781openalex-snapshot
A dual differentiable exact penalty function
inferredcites →https://doi.org/10.1007/bfb0067703openalex-snapshot
A fast algorithm for nonlinearly constrained optimization calculations
inferredcites →https://doi.org/10.1007/bfb0120958openalex-snapshot
Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0120980openalex-snapshot
Sufficient conditions for a globally exact penalty function without convexity
inferredcites →https://doi.org/10.1007/bfb0120984openalex-snapshot
Differential properties of the marginal function in mathematical programming
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50009-4openalex-snapshot
NUMERICAL EXPERIMENTS WITH AN EXACT L1 PENALTY FUNCTION METHOD
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0684505-9openalex-snapshot
A General Sufficiency Theorem for Nonsmooth Nonlinear Programming
inferredcites →https://doi.org/10.1109/cdc.1980.271786openalex-snapshot
Globally convergent Newton methods for constrained optimization using differentiable exact penalty functions
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/0706028openalex-snapshot
An Exact Potential Method for Constrained Maxima
inferredcites →https://doi.org/10.1137/0714022openalex-snapshot
A Penalty Function Method Converging Directly to a Constrained Optimum
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1137/1013001openalex-snapshot
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
inferredcites →https://doi.org/10.1287/moor.6.3.437openalex-snapshot
Globally Convergent Algorithms for Convex Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1985.tb00459.xopenalex-snapshot
Papers by AT&T Bell Laboratories Authors
inferred← citeshttps://doi.org/10.1006/jmaa.2001.7484openalex-snapshot
Efficiency and Approachability of Nonconvex Bicriteria Programs
inferred← citeshttps://doi.org/10.1007/0-387-24255-4_3openalex-snapshot
Duality and Exact Penalization via a Generalized Augmented Lagrangian Function
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_7openalex-snapshot
Exact Penalty Functions for Nondifferentiable Programming Problems
inferred← citeshttps://doi.org/10.1007/bf00939871openalex-snapshot
Lower bounds of controlling parameters of exact penalty functions in locally Lipschitz programming
inferred← citeshttps://doi.org/10.1007/bf00940081openalex-snapshot
Differential stability in non-Lipschitzian optimization
inferred← citeshttps://doi.org/10.1007/bf01070239openalex-snapshot
Exact penalty method with integrated consideration of the constraints
inferred← citeshttps://doi.org/10.1007/bf01189901openalex-snapshot
Exact barrier function methods for Lipschitz programs
inferred← citeshttps://doi.org/10.1007/bf01445158openalex-snapshot
Global convergence of a semi-infinite optimization method
inferred← citeshttps://doi.org/10.1007/bf01580901openalex-snapshot
ε-optimality criteria for convex programming problems via exact penalty functions
inferred← citeshttps://doi.org/10.1007/bf02006063openalex-snapshot
On theL 1 exact penalty function with locally lipschitz functions
inferred← citeshttps://doi.org/10.1007/bf02346165openalex-snapshot
Exact penalties and sufficient conditions for optimality in nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s00500-022-07459-0openalex-snapshot
On the exact $$l_{1}$$ penalty function method for convex nonsmooth optimization problems with fuzzy objective function
inferred← citeshttps://doi.org/10.1007/s10483-015-1929-9openalex-snapshot
Exactness of penalization for exact minimax penalty function method in nonconvex programming
inferred← citeshttps://doi.org/10.1007/s10589-006-6441-5openalex-snapshot
Calmness and Exact Penalization in Vector Optimization with Cone Constraints
inferred← citeshttps://doi.org/10.1007/s10589-006-8720-6openalex-snapshot
On the Smoothing of the Square-Root Exact Penalty Function for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s10898-012-9900-9openalex-snapshot
Exactness and algorithm of an objective penalty function
inferred← citeshttps://doi.org/10.1007/s10898-012-9910-7openalex-snapshot
Convergence of a class of penalty methods for constrained scalar set-valued optimization
inferred← citeshttps://doi.org/10.1007/s10957-010-9666-5openalex-snapshot
Second-Order Analysis of Penalty Function
inferred← citeshttps://doi.org/10.1007/s10957-012-9998-4openalex-snapshot
Calmness and Exact Penalization in Constrained Scalar Set-Valued Optimization
inferred← citeshttps://doi.org/10.1007/s10957-013-0338-0openalex-snapshot
Calmness and Exact Penalization in Vector Optimization under Nonlinear Perturbations
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.1007/s11075-016-0208-6openalex-snapshot
An adaptive competitive penalty method for nonsmooth constrained optimization
inferred← citeshttps://doi.org/10.1007/s11424-015-3204-3openalex-snapshot
An M-Objective Penalty Function Algorithm Under Big Penalty Parameters
inferred← citeshttps://doi.org/10.1007/s11590-015-0967-3openalex-snapshot
The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming
inferred← citeshttps://doi.org/10.1007/s40840-016-0340-4openalex-snapshot
Vector Exponential Penalty Function Method for Nondifferentiable Multiobjective Programming Problems
inferred← citeshttps://doi.org/10.1016/j.amc.2012.02.056openalex-snapshot
The vector exact l1 penalty method for nondifferentiable convex multiobjective programming problems
inferred← citeshttps://doi.org/10.1016/j.cam.2026.117419openalex-snapshot
A new vector exponential exact penalty approach for solving nonsmooth vector optimization problems
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.05.003openalex-snapshot
The l1 exact G -penalty function method and G -invex mathematical programming problems
inferred← citeshttps://doi.org/10.1023/a:1016522528364openalex-snapshot
On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization
inferred← citeshttps://doi.org/10.1051/m2an/1990240201971openalex-snapshot
Théorie de la pénalisation exacte
inferred← citeshttps://doi.org/10.1080/00207179.2014.972464openalex-snapshot
Model predictive control for tracking randomly varying references
inferred← citeshttps://doi.org/10.1080/00207179.2019.1661523openalex-snapshot
Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints
inferred← citeshttps://doi.org/10.1080/00207728708967135openalex-snapshot
ImplementableL∞penalty-function method for semi-infinite optimization
inferred← citeshttps://doi.org/10.1080/01630563.2016.1233118openalex-snapshot
The Exactness Property of the Vector Exact l1 Penalty Function Method in Nondifferentiable Invex Multiobjective Programming
inferred← citeshttps://doi.org/10.1080/02331930410001662199openalex-snapshot
An exact lower order penalty function and its smoothing in nonlinear programming
inferred← citeshttps://doi.org/10.1080/02331934.2018.1545123openalex-snapshot
An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
inferred← citeshttps://doi.org/10.1080/02331939108843701openalex-snapshot
Exact penalty functions and Lagrange multipliers
inferred← citeshttps://doi.org/10.1080/10556780600627693openalex-snapshot
Lower order calmness and exact penalty function
inferred← citeshttps://doi.org/10.1081/nfa-120022928openalex-snapshot
Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1109/cso.2010.156openalex-snapshot
A Smoothing Method of the Square-root Exact Penalty Function for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1109/cso.2010.157openalex-snapshot
A New Smooth Method for the l1 Exact Penalty Function for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1109/icgcs.2010.5543030openalex-snapshot
Quadratic smoothing approximation to 1 over 2-order exact penalty function
inferred← citeshttps://doi.org/10.1109/tac.2025.3558871openalex-snapshot
Automatic Nonlinear MPC Approximation With Closed-Loop Guarantees
inferred← citeshttps://doi.org/10.1137/0329054openalex-snapshot
An Exact Penalization Viewpoint of Constrained Optimization
inferred← citeshttps://doi.org/10.1137/090780201openalex-snapshot
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1137/s0363012996301269openalex-snapshot
Weak Sharp Minima: Characterizations and Sufficient Conditions
inferred← citeshttps://doi.org/10.1137/s1052623401384850openalex-snapshot
Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization
inferred← citeshttps://doi.org/10.1155/2018/7484256openalex-snapshot
An Objective Penalty Function-Based Method for Inequality Constrained Minimization Problem
inferred← citeshttps://doi.org/10.1155/2024/1224408openalex-snapshot
A Smooth Penalty Function Algorithm for Computing Nonlinear Inequality Constraint Optimization Problem
inferred← citeshttps://doi.org/10.1287/moor.13.3.512openalex-snapshot
A Geometrically Convergent Subgradient Optimization Method for Nonlinearly Constrained Convex Programs
inferred← citeshttps://doi.org/10.14317/jami.2015.387openalex-snapshot
SMOOTHING APPROXIMATION TO l1EXACT PENALTY FUNCTION FOR CONSTRAINED OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.22436/jmcs.023.01.04openalex-snapshot
A new perturbed smooth penalty function for inequality constrained optimization
inferred← citeshttps://doi.org/10.2514/6.2010-8167openalex-snapshot
The Design of Trigger Mechanisms for Aircraft Collision Avoidance Maneuvers
inferred← citeshttps://doi.org/10.25560/6445openalex-snapshot
Prohibited Volume Avoidance for Aircraft
inferred← citeshttps://doi.org/10.3390/mca22020031openalex-snapshot
A New Smoothing Nonlinear Penalty Function for Constrained Optimization
inferred← citeshttps://doi.org/10.37394/23206.2024.23.44openalex-snapshot
Solving the Class of Nonsmooth Nonconvex Fuzzy Optimization Problems via the Absolute Value Exact Fuzzy Penalty Function Method
inferred← citeshttps://doi.org/10.5556/j.tkjm.50.2019.2625openalex-snapshot
Perturbed smoothing approach to the lower order exact penalty functions for nonlinear inequality constrained optimization
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.