On the public citation graph
Exact penalty functions in nonlinear programming
0 signed · 338 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/978-3-0348-0439-4_10openalex-snapshot
Minima of Functions of Several Variables with Inequalities as Side Conditions
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_12openalex-snapshot
Second Order Conditions for Constrained Minima
inferredcites →https://doi.org/10.1007/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bf01580117openalex-snapshot
An exact penalty function for nonlinear programming with inequalities
inferredcites →https://doi.org/10.1007/bf01580366openalex-snapshot
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
inferredcites →https://doi.org/10.1007/bf01580395openalex-snapshot
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
inferredcites →https://doi.org/10.1007/bf01584071openalex-snapshot
Recent advances in unconstrained optimization
inferredcites →https://doi.org/10.1007/bf01584552openalex-snapshot
On using equality-constraint algorithms for inequality constrained problems
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear 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.1016/0022-247x(67)90028-5openalex-snapshot
Lagrange multipliers and nonlinear programming
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1016/0024-3795(79)90014-4openalex-snapshot
Uniqueness of solution in linear programming
inferredcites →https://doi.org/10.1016/b978-0-12-468660-1.50007-4openalex-snapshot
THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS
inferredcites →https://doi.org/10.1080/00949657208810027openalex-snapshot
Parallel tangents and steepest descent optimization algorithm-a computer implementation with application to linear, partially linear models and qualitative data
inferredcites →https://doi.org/10.1093/comjnl/10.3.293openalex-snapshot
Minimizing a function without calculating derivatives
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1093/comjnl/7.2.155openalex-snapshot
An efficient method for finding the minimum of a function of several variables without calculating derivatives
inferredcites →https://doi.org/10.1137/0120021openalex-snapshot
A Necessary and Sufficient Qualification for Constrained Optimization
inferredcites →https://doi.org/10.1137/0304041openalex-snapshot
Constrained Minimization Problems in Finite-Dimensional Spaces
inferredcites →https://doi.org/10.1137/0311029openalex-snapshot
New Conditions for Exactness of a Simple Penalty Function
inferredcites →https://doi.org/10.1137/0706028openalex-snapshot
An Exact Potential Method for Constrained Maxima
inferredcites →https://doi.org/10.1137/0713043openalex-snapshot
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
inferredcites →https://doi.org/10.1145/321510.321520openalex-snapshot
Lattice Approximations to the Minima of Functions of Several Variables
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferredcites →https://doi.org/10.1287/mnsc.16.5.350openalex-snapshot
A Class of Inside-Out Algorithms for General Programs
inferredcites →https://doi.org/10.1287/mnsc.21.5.600openalex-snapshot
Note on Finite Convergence of Exterior Penalty Functions
inferredcites →https://doi.org/10.1287/opre.18.1.1openalex-snapshot
A Case History in Optimum Inventory Scheduling
inferredcites →https://doi.org/10.1287/opre.18.1.107openalex-snapshot
Stability in Nonlinear Programming
inferredcites →https://doi.org/10.1287/opre.18.2.229openalex-snapshot
Generalized Penalty-Function Concepts in Mathematical Optimization
inferredcites →https://doi.org/10.6100/ir19751openalex-snapshot
Boundary properties of penalty functions for constrained minimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.1670110403openalex-snapshot
A penalty approximation for a unilateral contact problem in non‐linear elasticity
inferred← citeshttps://doi.org/10.1002/oca.2273openalex-snapshot
An improved smoothing technique-based control vector parameterization method for optimal control problems with inequality path constraints
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.1002/tee.23201openalex-snapshot
Regulated Evolution Strategies: A Framework of Evolutionary Algorithms with Stability Analysis Result
inferred← citeshttps://doi.org/10.1006/jmaa.1996.0080openalex-snapshot
ϵ-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function
inferred← citeshttps://doi.org/10.1006/rtph.2000.1404openalex-snapshot
Incorporating Model Uncertainties along with Data Uncertainties in Microbial Risk Assessment
inferred← citeshttps://doi.org/10.1007/0-387-24276-7_21openalex-snapshot
Variational Control Problems with Constraints Via Exact Penalization
inferred← citeshttps://doi.org/10.1007/3-540-07622-0_488openalex-snapshot
A four-variable world system
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_155openalex-snapshot
Parallel Constrained Optimization via Distribution of Variables
inferred← citeshttps://doi.org/10.1007/978-1-4613-0239-1_5openalex-snapshot
Constrained Problems of Calculus of Variations Via Penalization Technique
inferred← citeshttps://doi.org/10.1007/978-1-4613-0239-1_6openalex-snapshot
Variational Problems with Constraints Involving Higher-Order Derivatives
inferred← citeshttps://doi.org/10.1007/978-1-4613-0279-7_2openalex-snapshot
Nonsmooth Problems in Mathematical Diagnostics
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_9openalex-snapshot
Adaptive Control via Non-Convex Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_6openalex-snapshot
Sequential Quadratic Programming Methods
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_7openalex-snapshot
Numerical Methods for Semi-Infinite Programming: A Survey
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-22788-3_7openalex-snapshot
An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-25958-7_2openalex-snapshot
Electric Power System with Renewable Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_7openalex-snapshot
Local Search for Nonsmooth DC Optimization with DC Equality and Inequality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-38603-0_17openalex-snapshot
On a Global Search in D.C. Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-40616-5_9openalex-snapshot
Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-49988-4_1openalex-snapshot
Global and Local Search Methods for D.C. Constrained Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07671-3_10openalex-snapshot
Optimizing Under Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-17689-5_6openalex-snapshot
An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-33255-0_10openalex-snapshot
Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-58356-3_7openalex-snapshot
Penalty and Augmented Lagrangian Methods
inferred← citeshttps://doi.org/10.1007/978-3-322-89416-8_2openalex-snapshot
Active Constraint Strategies in Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_33openalex-snapshot
Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-36062-6_46openalex-snapshot
The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_14openalex-snapshot
Exact Auxiliary Functions in Non-Convex Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-52074-7_19openalex-snapshot
Geometrische Charakterisierung exakter Penalty-Funktionen
inferred← citeshttps://doi.org/10.1007/978-3-642-52465-3_23openalex-snapshot
Sequential Quadratic Programming Methods for Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_25openalex-snapshot
Recent Advances on Second-Order Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-83707-4_7openalex-snapshot
Solving Scalar Problems of Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-00638-2_1openalex-snapshot
Resolution Numerique D’inegalites Variationnelles
inferred← citeshttps://doi.org/10.1007/978-981-15-3576-5_11openalex-snapshot
Distributed Multi-Agent Optimization Protocol over Energy Management Networks
inferred← citeshttps://doi.org/10.1007/bf00245256openalex-snapshot
Portfolio selection under the condition of value preservation
inferred← citeshttps://doi.org/10.1007/bf00933227openalex-snapshot
An exponential penalty method for nondifferentiable minimax problems with general constraints
inferred← citeshttps://doi.org/10.1007/bf00933968openalex-snapshot
A least-distance programming procedure for minimization problems under linear constraints
inferred← citeshttps://doi.org/10.1007/bf00934744openalex-snapshot
On a space extension algorithm for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf00935007openalex-snapshot
Multiobjective programming and penalty functions
inferred← citeshttps://doi.org/10.1007/bf00935173openalex-snapshot
A minimization method for the sum of a convex function and a continuously differentiable function
inferred← citeshttps://doi.org/10.1007/bf00935360openalex-snapshot
Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
inferred← citeshttps://doi.org/10.1007/bf00935442openalex-snapshot
Theorems of the alternative and optimality conditions
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/bf00940028openalex-snapshot
Image space approach to penalty methods
inferred← citeshttps://doi.org/10.1007/bf00940081openalex-snapshot
Differential stability in non-Lipschitzian optimization
inferred← citeshttps://doi.org/10.1007/bf00940570openalex-snapshot
A method for minimizing the sum of a convex function and a continuously differentiable function
inferred← citeshttps://doi.org/10.1007/bf01068354openalex-snapshot
Exact penalty function for nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/bf01070239openalex-snapshot
Exact penalty method with integrated consideration of the constraints
inferred← citeshttps://doi.org/10.1007/bf01072022openalex-snapshot
Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment
inferred← citeshttps://doi.org/10.1007/bf01189901openalex-snapshot
Exact barrier function methods for Lipschitz programs
inferred← citeshttps://doi.org/10.1007/bf01371083openalex-snapshot
A generalized quadratic programming-based phase I-phase II method for inequality-constrained optimization
inferred← citeshttps://doi.org/10.1007/bf01391417openalex-snapshot
A quadratic approximation method for minimizing a class of quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01442401openalex-snapshot
Finite perturbation of convex programs
inferred← citeshttps://doi.org/10.1007/bf01580901openalex-snapshot
ε-optimality criteria for convex programming problems via exact penalty functions
inferred← citeshttps://doi.org/10.1007/bf01581078openalex-snapshot
Exterior point algorithms for nearest points and convex quadratic programs
inferred← citeshttps://doi.org/10.1007/bf01581639openalex-snapshot
Second-order conditions for an exact penalty function
inferred← citeshttps://doi.org/10.1007/bf01582222openalex-snapshot
Optimality conditions in mathematical programming and composite optimization
inferred← citeshttps://doi.org/10.1007/bf01582294openalex-snapshot
A robust sequential quadratic programming method
inferred← citeshttps://doi.org/10.1007/bf01585095openalex-snapshot
Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
inferred← citeshttps://doi.org/10.1007/bf01585171openalex-snapshot
Nonlinear complementarity as unconstrained and constrained minimization
inferred← citeshttps://doi.org/10.1007/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf01594922openalex-snapshot
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
inferred← citeshttps://doi.org/10.1007/bf01609033openalex-snapshot
A lower bound for the controlling parameters of the exact penalty functions
inferred← citeshttps://doi.org/10.1007/bf01681332openalex-snapshot
Necessary and sufficient conditions for a penalty method to be exact
inferred← citeshttps://doi.org/10.1007/bf02346160openalex-snapshot
On the exactness of a class of nondifferentiable penalty 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/bf02591938openalex-snapshot
Exact penalty functions and stability in locally Lipschitz programming
inferred← citeshttps://doi.org/10.1007/bf02591986openalex-snapshot
An exact penalty function method with global convergence properties for nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/bf02592056openalex-snapshot
Penalty functions in ε-programming and ε-minimax problems
inferred← citeshttps://doi.org/10.1007/bf02594781openalex-snapshot
A dual differentiable exact penalty function
inferred← citeshttps://doi.org/10.1007/bf02614389openalex-snapshot
Separating plane algorithms for convex optimization
inferred← citeshttps://doi.org/10.1007/bf02936065openalex-snapshot
A dual algorithm for minimax problems
inferred← citeshttps://doi.org/10.1007/bf03167197openalex-snapshot
Successive linearization methods for large-scale nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/bf03322614openalex-snapshot
Duality and Regularization for INF-Sup Problems
inferred← citeshttps://doi.org/10.1007/bfb0008353openalex-snapshot
New approaches in optimization techniques
inferred← citeshttps://doi.org/10.1007/bfb0042224openalex-snapshot
A step-size selection procedure for equality constrained optimization
inferred← citeshttps://doi.org/10.1007/bfb0042789openalex-snapshot
Recent results on nondifferentiable exact penalty functions
inferred← citeshttps://doi.org/10.1007/bfb0076702openalex-snapshot
Non-linear separation theorems, duality and optimality conditions
inferred← citeshttps://doi.org/10.1007/bfb0079165openalex-snapshot
Exact penalty—Functions in infinite optimization
inferred← citeshttps://doi.org/10.1007/bfb0083583openalex-snapshot
Local study of newton type algorithms for constrained problems
inferred← citeshttps://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bfb0120980openalex-snapshot
Sufficient conditions for a globally exact penalty function without convexity
inferred← citeshttps://doi.org/10.1007/bfb0120989openalex-snapshot
Generalized equations and their solutions, part II: Applications to nonlinear programming
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/s10107-010-0408-0openalex-snapshot
A line search exact penalty method using steering rules
inferred← citeshttps://doi.org/10.1007/s101070100252openalex-snapshot
On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy
inferred← citeshttps://doi.org/10.1007/s10287-009-0097-4openalex-snapshot
Restricted generalized Nash equilibria and controlled penalty algorithm
inferred← citeshttps://doi.org/10.1007/s10479-021-04075-3openalex-snapshot
A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
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/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-8720-6openalex-snapshot
On the Smoothing of the Square-Root Exact Penalty Function for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s10589-007-9011-6openalex-snapshot
Smoothed penalty algorithms for optimization of nonlinear models
inferred← citeshttps://doi.org/10.1007/s10589-019-00109-6openalex-snapshot
A subspace SQP method for equality constrained 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-006-9107-zopenalex-snapshot
Simulated annealing with asymptotic convergence for nonlinear 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-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-01116-wopenalex-snapshot
An approximate lower order penalty approach for solving second-order cone linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10957-010-9666-5openalex-snapshot
Second-Order Analysis of Penalty Function
inferred← citeshttps://doi.org/10.1007/s10957-013-0335-3openalex-snapshot
A Lower Bound for the Penalty Parameter in the Exact Minimax Penalty Function Method for Solving Nondifferentiable Extremum Problems
inferred← citeshttps://doi.org/10.1007/s10957-017-1091-6openalex-snapshot
Existence of Augmented Lagrange Multipliers for Semi-infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/s10957-017-1130-3openalex-snapshot
Transversality in Variational Analysis
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-012-9692-5openalex-snapshot
A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
inferred← citeshttps://doi.org/10.1007/s11075-020-00881-1openalex-snapshot
Flattened aggregate function method for nonlinear programming with many complicated constraints
inferred← citeshttps://doi.org/10.1007/s11081-015-9294-xopenalex-snapshot
Variations and extension of the convex–concave procedure
inferred← citeshttps://doi.org/10.1007/s11117-015-0350-8openalex-snapshot
Approximate solutions of multiobjective optimization problems
inferred← citeshttps://doi.org/10.1007/s11228-006-0024-6openalex-snapshot
Existence of Exact Penalty for Constrained Optimization Problems in Metric Spaces
inferred← citeshttps://doi.org/10.1007/s11228-007-0047-7openalex-snapshot
Existence of Exact Penalty and Its Stability for Nonconvex Constrained Optimization Problems in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11228-010-0144-xopenalex-snapshot
An Estimation of Exact Penalty for Infinite-Dimensional Inequality-Constrained Minimization Problems
inferred← citeshttps://doi.org/10.1007/s11269-012-0226-7openalex-snapshot
Application of Artificial Neural Networks and Particle Swarm Optimization for the Management of Groundwater Resources
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.1007/s11590-015-0961-9openalex-snapshot
Smooth exact penalty functions II: a reduction to standard exact penalty functions
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/s11590-017-1214-xopenalex-snapshot
Global optimality conditions and exact penalization
inferred← citeshttps://doi.org/10.1007/s11741-001-0041-5openalex-snapshot
A new kind of simple smooth exact penalty function of constrained nonlinear programming
inferred← citeshttps://doi.org/10.1007/s12597-023-00663-yopenalex-snapshot
On the exactness and the convergence of the $$l_{1}$$ exact penalty E-function method for E-differentiable optimization problems
inferred← citeshttps://doi.org/10.1007/s40314-015-0291-7openalex-snapshot
On the augmented subproblems within sequential methods for nonlinear 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/0022-247x(81)90047-0openalex-snapshot
An algorithm for linearly constrained nonlinear programming problems
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90100-2openalex-snapshot
A stable theorem of the alternative: an extension of the gordan theorem
inferred← citeshttps://doi.org/10.1016/0041-5553(84)90244-1openalex-snapshot
On some estimates of the penalty coefficient in methods of exact penalty functions
inferred← citeshttps://doi.org/10.1016/0041-5553(90)90005-dopenalex-snapshot
Exact auxiliary functions in optimization problems
inferred← citeshttps://doi.org/10.1016/0096-3003(85)90002-5openalex-snapshot
An exact penalty method for solving optimal control problems
inferred← citeshttps://doi.org/10.1016/0098-1354(87)87002-3openalex-snapshot
A robust technique for process flowsheet optimization using simplified model approximations
inferred← citeshttps://doi.org/10.1016/0098-1354(90)85005-uopenalex-snapshot
Simultaneous strategies for optimization of differential-algebraic systems with enforcement of error criteria
inferred← citeshttps://doi.org/10.1016/0098-1354(93)80007-aopenalex-snapshot
Iterated linear programming strategies for non-smooth simulation: A penalty based method for vapor—liquid equilibrium applications
inferred← citeshttps://doi.org/10.1016/0167-6377(81)90024-9openalex-snapshot
An economic interpretation of exact penalty functions using sensitivity analysis
inferred← citeshttps://doi.org/10.1016/0360-8352(82)90008-0openalex-snapshot
An efficient algorithm for solving constrained nonlinear programming problems
inferred← citeshttps://doi.org/10.1016/0360-8352(85)90019-1openalex-snapshot
Penalty function techniques: A tutorial
inferred← citeshttps://doi.org/10.1016/0362-546x(94)90218-6openalex-snapshot
Generalized second-order derivatives and optimality conditions
inferred← citeshttps://doi.org/10.1016/0377-0427(88)90276-2openalex-snapshot
A globally convergent SQP method for semi-infinite nonlinear optimization
inferred← citeshttps://doi.org/10.1016/0377-0427(88)90405-0openalex-snapshot
Recent developments in constrained optimization
inferred← citeshttps://doi.org/10.1016/0377-2217(81)90097-7openalex-snapshot
A globally convergent algorithm for exact penalty functions
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90405-zopenalex-snapshot
Use of exact penalty functions to determine efficient decisions
inferred← citeshttps://doi.org/10.1016/0928-7655(93)90011-iopenalex-snapshot
Minimal adjustment costs, factor demands, and seasonal time-of-use electricity rates
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50007-0openalex-snapshot
SOLVING QUADRATIC PROGRAMS BY AN EXACT PENALTY FUNCTION11This work is supported in part by the National Science Foundation under Grant ENG 79-03881 and also by the United States Army under Contract No. DAAG29-75-C-0024.
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50009-4openalex-snapshot
NUMERICAL EXPERIMENTS WITH AN EXACT L1 PENALTY FUNCTION METHOD
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50018-5openalex-snapshot
APPROXIMATION AND CONVERGENCE IN NONLINEAR OPTIMIZATION
inferred← citeshttps://doi.org/10.1016/j.amc.2011.01.051openalex-snapshot
A new exact exponential penalty function method and nonconvex mathematical programming
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.amc.2014.08.092openalex-snapshot
On local search in d.c. optimization problems
inferred← citeshttps://doi.org/10.1016/j.amc.2015.01.044openalex-snapshot
Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
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.apm.2011.11.014openalex-snapshot
Sequential quadratic programming with a flexible step acceptance strategy
inferred← citeshttps://doi.org/10.1016/j.apm.2017.07.031openalex-snapshot
A local search method for optimization problem with d.c. inequality constraints
inferred← citeshttps://doi.org/10.1016/j.ast.2017.08.042openalex-snapshot
Trajectory optimization for solar sail in cislunar navigation constellation with minimal lightness number
inferred← citeshttps://doi.org/10.1016/j.cam.2011.02.031openalex-snapshot
A penalty function method based on smoothing lower order penalty function
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.117419openalex-snapshot
A new vector exponential exact penalty approach for solving nonsmooth vector optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.07.031openalex-snapshot
Exact penalty functions method for mathematical programming problems involving invex functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.01.033openalex-snapshot
A linear programming-based optimization algorithm for solving nonlinear programming problems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.11.431openalex-snapshot
On Nonconvex Optimization Problems with D.C. Equality and Inequality Constraints
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.1798openalex-snapshot
The ℓ1—Exact Penalty-Barrier Phase for Degenerate Nonlinear Programming Problems in Ipopt
inferred← citeshttps://doi.org/10.1016/j.jconhyd.2013.05.003openalex-snapshot
Optimal design of an in-situ bioremediation system using support vector machine and particle swarm optimization
inferred← citeshttps://doi.org/10.1016/j.jobe.2019.101025openalex-snapshot
Optimization of building form to reduce incident solar radiation
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.1016/j.mechatronics.2015.06.015openalex-snapshot
Symbolic discrete-time planning with continuous numeric action parameters for agent-controlled processes
inferred← citeshttps://doi.org/10.1016/j.na.2006.04.024openalex-snapshot
Existence of exact penalty for constrained optimization problems in Hilbert spaces
inferred← citeshttps://doi.org/10.1016/j.na.2009.01.217openalex-snapshot
Existence and stability of exact penalty for optimization problems with mixed constraints
inferred← citeshttps://doi.org/10.1016/j.na.2009.01.233openalex-snapshot
Penalty function methods and a duality gap for invex optimization problems
inferred← citeshttps://doi.org/10.1016/j.na.2009.10.047openalex-snapshot
Exact penalty results for mathematical programs with vanishing constraints
inferred← citeshttps://doi.org/10.1016/j.na.2011.05.097openalex-snapshot
On the Karush–Kuhn–Tucker reformulation of the bilevel optimization problem
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/j.orl.2016.02.009openalex-snapshot
An infeasibility certificate for nonlinear programming based on Pareto criticality condition
inferred← citeshttps://doi.org/10.1016/j.petrol.2021.109165openalex-snapshot
Ensemble-based constrained optimization using an exterior penalty method
inferred← citeshttps://doi.org/10.1016/s0041-5553(83)80045-7openalex-snapshot
Two modifications of the linearization method in non-linear programming
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.1016/s0898-1221(99)00058-9openalex-snapshot
Global minimization of constrained problems with discontinuous penalty functions
inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00105-4openalex-snapshot
ε-Optimality and duality for multiobjective fractional programming
inferred← citeshttps://doi.org/10.1016/s1004-9541(12)60586-2openalex-snapshot
An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization (I) Problems Without Path Constraints
inferred← citeshttps://doi.org/10.1016/s1004-9541(14)60001-xopenalex-snapshot
An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization. II. Problems with Path Constraints
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39644-1openalex-snapshot
Nonsmooth Penalty Functions
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)63540-7openalex-snapshot
An Approach to Optimal Control Problems Via Exact Penalty Functions
inferred← citeshttps://doi.org/10.1023/a:1008701324575openalex-snapshot
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method
inferred← citeshttps://doi.org/10.1023/a:1011942228555openalex-snapshot
A Modified SQP Method with Nonmonotone Linesearch Technique
inferred← citeshttps://doi.org/10.1023/a:1016083601322openalex-snapshot
Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization
inferred← citeshttps://doi.org/10.1023/a:1021882608212openalex-snapshot
Linearization and Penalty Functions
inferred← citeshttps://doi.org/10.1051/m2an/1990240201971openalex-snapshot
Théorie de la pénalisation exacte
inferred← citeshttps://doi.org/10.1057/jors.1977.181openalex-snapshot
Mathematical Programming Studies
inferred← citeshttps://doi.org/10.1061/(asce)he.1943-5584.0001622openalex-snapshot
Simulation-Optimization Approach for the Consideration of Well Clogging during Cost Estimation of In Situ Bioremediation System
inferred← citeshttps://doi.org/10.1063/5.0095371openalex-snapshot
A smoothing approximation method for classical l1 exact penalty function for optimization problems.
inferred← citeshttps://doi.org/10.1080/01630563.2011.577262openalex-snapshot
A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1080/01630563.2013.811421openalex-snapshot
Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1080/01630563.2015.1070864openalex-snapshot
Augmented Lagrangian Objective Penalty Function
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/01630568908816342openalex-snapshot
A lagrangian penalty function method for monotone variational inequalities
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/02331930500138494openalex-snapshot
Identification of point sets by quasidifferentiable functions
showing the first 199 of 300 · page through all 300
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.