On the public citation graph

An exact penalty function method with global convergence properties for nonlinear programming problems

0 signed · 116 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.1007/978-3-642-68874-4_5openalex-snapshot
Penalty Functions
inferredcites →https://doi.org/10.1007/bf01582118openalex-snapshot
A first order, exact penalty function algorithm for equality constrained optimization problems
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588240openalex-snapshot
A multiplier method with automatic limitation of penalty growth
inferredcites →https://doi.org/10.1007/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01681354openalex-snapshot
A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
inferredcites →https://doi.org/10.1007/bfb0008898openalex-snapshot
A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems
inferredcites →https://doi.org/10.1007/bfb0043895openalex-snapshot
Globally convergent exact penalty algorithms for constrained optimization
inferredcites →https://doi.org/10.1007/bfb0120947openalex-snapshot
A surperlinearly convergent algorithm for constrained optimization problems
inferredcites →https://doi.org/10.1016/0005-1098(76)90053-4openalex-snapshot
On the global stabilization of locally convergent algorithms
inferredcites →https://doi.org/10.1016/0377-2217(83)90067-xopenalex-snapshot
Nonlinear optimization 1981
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1016/c2013-0-11400-6openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0323007openalex-snapshot
A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
inferredcites →https://doi.org/10.1137/0706027openalex-snapshot
Some Extensions of a Paper by Birkhoff and Priver
inferredcites →https://doi.org/10.1137/0706028openalex-snapshot
An Exact Potential Method for Constrained Maxima
inferredcites →https://doi.org/10.1137/1.9781611971255openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferredcites →https://doi.org/10.1287/moor.4.4.425openalex-snapshot
The Generic Nature of Optimality Conditions in Nonlinear Programming
inferredcites →https://doi.org/10.2307/3008203openalex-snapshot
Integer and Non-Linear 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/9780470400531.eorms1006openalex-snapshot
L ipschitz Global Optimization
inferred← citeshttps://doi.org/10.1002/nme.1620320706openalex-snapshot
Multiplier methods for engineering optimization
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.1002/qre.2626openalex-snapshot
Structural reliability assessment by salp swarm algorithm–based FORM
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/978-3-030-54621-2_764-1openalex-snapshot
Lipschitz Expensive Global Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-93642-6_3openalex-snapshot
The Role of grossone in Nonlinear Programming and Exact Penalty Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-26790-1_21openalex-snapshot
Penalty and Augmented Lagrangian Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_22openalex-snapshot
Numerical Experiments with Modern Methods for Large Scale QP-Problems
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_8openalex-snapshot
Exact Penalty Methods
inferred← citeshttps://doi.org/10.1007/bf00939685openalex-snapshot
New results on a class of exact augmented Lagrangians
inferred← citeshttps://doi.org/10.1007/bf00941057openalex-snapshot
Random tunneling by means of acceptance-rejection sampling for global optimization
inferred← citeshttps://doi.org/10.1007/bf01097003openalex-snapshot
On the role of continuously differentiable exact penalty functions in constrained global optimization
inferred← citeshttps://doi.org/10.1007/bf01189901openalex-snapshot
Exact barrier function methods for Lipschitz programs
inferred← citeshttps://doi.org/10.1007/bf01432651openalex-snapshot
Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding
inferred← citeshttps://doi.org/10.1007/bf01580609openalex-snapshot
A smooth method for the finite minimax problem
inferred← citeshttps://doi.org/10.1007/bf01581190openalex-snapshot
An RQP algorithm using a differentiable exact penalty function for inequality constrained problems
inferred← citeshttps://doi.org/10.1007/bf01585171openalex-snapshot
Nonlinear complementarity as unconstrained and constrained minimization
inferred← citeshttps://doi.org/10.1007/bf01743964openalex-snapshot
Global optimization methods for engineering applications: A review
inferred← citeshttps://doi.org/10.1007/bf02014586openalex-snapshot
A new successive quadratic programming algorithm
inferred← citeshttps://doi.org/10.1007/bf02192160openalex-snapshot
A Newton-type method for positive-semidefinite linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02207778openalex-snapshot
A parallel method for finding the global minimum of univariate functions
inferred← citeshttps://doi.org/10.1007/bf02346160openalex-snapshot
On the exactness of a class of nondifferentiable penalty functions
inferred← citeshttps://doi.org/10.1007/pl00013279openalex-snapshot
Elimination of inequality constraints in convex optimization and application to yield design
inferred← citeshttps://doi.org/10.1007/s00521-017-2903-1openalex-snapshot
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem
inferred← citeshttps://doi.org/10.1007/s10107-022-01794-8openalex-snapshot
An exact penalty approach for optimization with nonnegative orthogonality constraints
inferred← citeshttps://doi.org/10.1007/s10107-023-01935-7openalex-snapshot
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming
inferred← citeshttps://doi.org/10.1007/s10483-012-1597-xopenalex-snapshot
New simple exact penalty function for constrained minimization
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/s10589-008-9216-3openalex-snapshot
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
inferred← citeshttps://doi.org/10.1007/s10589-022-00358-yopenalex-snapshot
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
inferred← citeshttps://doi.org/10.1007/s10898-006-9038-8openalex-snapshot
Exact Penalty Functions for Constrained Minimization Problems via Regularized Gap Function for Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s10898-008-9347-1openalex-snapshot
Unified theory of augmented Lagrangian methods for constrained global 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-013-0111-9openalex-snapshot
A new class of exact penalty functions and penalty algorithms
inferred← citeshttps://doi.org/10.1007/s10898-019-00842-6openalex-snapshot
A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-021-01064-5openalex-snapshot
An objective penalty function method for biconvex programming
inferred← citeshttps://doi.org/10.1007/s10898-021-01116-wopenalex-snapshot
An approximate lower order penalty approach for solving second-order cone linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10957-012-0114-6openalex-snapshot
A Gauss–Newton Approach for Solving Constrained Optimization Problems Using Differentiable Exact Penalties
inferred← citeshttps://doi.org/10.1007/s10957-024-02421-6openalex-snapshot
Computing Second-Order Points Under Equality Constraints: Revisiting Fletcher’s Augmented Lagrangian
inferred← citeshttps://doi.org/10.1007/s11012-020-01250-xopenalex-snapshot
Optimum dimensional synthesis of planar mechanisms with geometric constraints
inferred← citeshttps://doi.org/10.1007/s11029-019-9784-6openalex-snapshot
Optimization of Extension-Shear Coupled Laminates Based on the Differential Evolution Algorithm
inferred← citeshttps://doi.org/10.1007/s11424-012-9226-1openalex-snapshot
A simple smooth exact penalty function for smooth optimization problem
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.1016/0167-6377(93)90027-eopenalex-snapshot
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
inferred← citeshttps://doi.org/10.1016/j.amc.2011.07.042openalex-snapshot
The use of grossone in Mathematical Programming and Operations Research
inferred← citeshttps://doi.org/10.1016/j.amc.2015.09.020openalex-snapshot
On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
inferred← citeshttps://doi.org/10.1016/j.amc.2017.03.029openalex-snapshot
Nonlinear programming and Grossone: Quadratic Programing and the role of Constraint Qualifications
inferred← citeshttps://doi.org/10.1016/j.cam.2015.05.007openalex-snapshot
A power penalty method for second-order cone nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2020.113168openalex-snapshot
Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2026.117513openalex-snapshot
Smooth-like lower order penalty approach for solving second-order cone mixed complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cep.2026.110783openalex-snapshot
Process intensification of methyl lactate production using a side-reactor dividing-wall column
inferred← citeshttps://doi.org/10.1016/j.compstruct.2018.09.095openalex-snapshot
Bending-twisting coupled structures based on composite laminates with extension-shear coupling effect
inferred← citeshttps://doi.org/10.1016/j.ijpvp.2022.104780openalex-snapshot
Research on treatment scheme of soil landslide in aviation oil pipeline based on oil-pipeline-soil multi-physical field coupling and anti-sliding simulation
inferred← citeshttps://doi.org/10.1016/j.orl.2014.12.012openalex-snapshot
A power penalty method for second-order cone linear complementarity problems
inferred← citeshttps://doi.org/10.1016/s0893-9659(04)90105-xopenalex-snapshot
An objective penalty function method for nonlinear programming
inferred← citeshttps://doi.org/10.1023/a:1022655423083openalex-snapshot
Robust Recursive Quadratic Programming Algorithm Model with Global and Superlinear Convergence Properties
inferred← citeshttps://doi.org/10.1023/a:1022948903451openalex-snapshot
An Exact Augmented Lagrangian Function for Nonlinear Programming with Two-Sided Constraints
inferred← citeshttps://doi.org/10.1080/02331939108843700openalex-snapshot
A differentiable exact penalty function for bound constrained quadratic programming problems
inferred← citeshttps://doi.org/10.1080/02331939108843701openalex-snapshot
Exact penalty functions and Lagrange multipliers
inferred← citeshttps://doi.org/10.1080/02331939208843855openalex-snapshot
A Class of penalty functions for optimization problema with bound constraints
inferred← citeshttps://doi.org/10.1080/02331939308843909openalex-snapshot
An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables
inferred← citeshttps://doi.org/10.1080/02331939508844053openalex-snapshot
Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
inferred← citeshttps://doi.org/10.1080/10556780008805793openalex-snapshot
A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables
inferred← citeshttps://doi.org/10.1080/10556789308805543openalex-snapshot
Structured second-and higher-order derivatives through univariate Taylor series
inferred← citeshttps://doi.org/10.1080/10556789408805553openalex-snapshot
Local properties of a newton-like direction for equality constrained minimization problems
inferred← citeshttps://doi.org/10.1090/conm/658/13128openalex-snapshot
Smoothing techniques for exact penalty methods
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/dcabes.2015.105openalex-snapshot
Surrogate-Based Optimization for Autonomous Underwater Vehicle's Shell Design
inferred← citeshttps://doi.org/10.1109/tmc.2019.2950921openalex-snapshot
Cost-Fair Task Allocation in Mobile Crowd Sensing With Probabilistic Users
inferred← citeshttps://doi.org/10.1111/1475-3995.t01-1-00330openalex-snapshot
Hyperbolic Penalty: A New Method for Nonlinear Programming with Inequalities
inferred← citeshttps://doi.org/10.1137/0327068openalex-snapshot
Exact Penalty Functions in Constrained Optimization
inferred← citeshttps://doi.org/10.1137/060667086openalex-snapshot
On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
inferred← citeshttps://doi.org/10.1137/0802027openalex-snapshot
New Results on a Continuously Differentiable Exact Penalty Function
inferred← citeshttps://doi.org/10.1137/0804027openalex-snapshot
On Smoothing Exact Penalty Functions for Convex Constrained Optimization
inferred← citeshttps://doi.org/10.1137/19m1238265openalex-snapshot
Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization
inferred← citeshttps://doi.org/10.1137/s1052623494278049openalex-snapshot
On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
inferred← citeshttps://doi.org/10.1137/s1052623497321894openalex-snapshot
An Augmented Lagrangian Function with Improved Exactness Properties
inferred← citeshttps://doi.org/10.1142/s0217595910002855openalex-snapshot
THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
inferred← citeshttps://doi.org/10.1142/s0217595920400187openalex-snapshot
Smoothing Partially Exact Penalty Function of Biconvex Programming
inferred← citeshttps://doi.org/10.1155/2018/9869105openalex-snapshot
Optimization of Hybrid Laminates with Extension-Shear Coupling
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.1177/096369351802700303openalex-snapshot
Hygro-Thermally Curvature-Stable Free-Layer Composite Laminates with Extension-Twist Coupling
inferred← citeshttps://doi.org/10.1287/moor.2020.1079openalex-snapshot
Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
inferred← citeshttps://doi.org/10.1287/moor.2023.1360openalex-snapshot
Dissolving Constraints for Riemannian Optimization
inferred← citeshttps://doi.org/10.12988/ams.2015.59566openalex-snapshot
Exact penalty method for minimizing of nonsmooth functions on convex sets
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.3390/e23020132openalex-snapshot
Partial Exactness for the Penalty Function of Biconvex Programming
inferred← citeshttps://doi.org/10.3390/math13050690openalex-snapshot
Completely Smooth Lower-Order Penalty Approach for Solving Second-Order Cone Mixed Complementarity Problems
inferred← citeshttps://doi.org/10.3390/mca22020031openalex-snapshot
A New Smoothing Nonlinear Penalty Function for Constrained Optimization
inferred← citeshttps://doi.org/10.3934/math.20241602openalex-snapshot
Objective penalty function method for nonlinear programming with inequality constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11518openalex-snapshot
Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization
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.