Non-Linear Programming Via Penalty Functions

DOI10.1287/mnsc.13.5.344zbMath0171.18202OpenAlexW1976086748MaRDI QIDQ5557622

Willard I. Zangwill

Publication date: 1967

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.13.5.344

zbMATH Keywords

operations research

Related Items (only showing first 100 items - show all)

Constrained Consensus-Based Optimization ⋮ A relaxed interior approach to nonlinear programming ⋮ Nonlinear programming via an exact penalty function: Global analysis ⋮ Nonlinear programming via an exact penalty function: Asymptotic analysis ⋮ Exact penalty functions and stability in locally Lipschitz programming ⋮ A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems ⋮ ON EXACT PENALTIES FOR CONSTRAINED OPTIMIZATION PROBLEMS IN METRIC SPACES ⋮ ON THE RELATION BETWEEN TWO APPROACHES TO EXTERIOR PENALTY METHOD FOR CONSTRAINED OPTIMAL CONTROL PROBLEMS ⋮ An old problem and new tools ⋮ Particle Swarm Optimization for Preference Disaggregation in Multicriteria Credit Scoring Problems ⋮ Mathematical diagnostics via nonsmooth analysis ⋮ Exact penalty functions in nonlinear programming ⋮ The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems ⋮ On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems ⋮ Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems ⋮ An exact penalty function method with global convergence properties for nonlinear programming problems ⋮ Vectorial penalisation in vector optimisation in real linear-topological spaces ⋮ G-penalty approach for multi-dimensional control optimisation problem with nonlinear dynamical system ⋮ Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization ⋮ Hyperbolic regression: a new regression model with applications to the binary classification problem ⋮ Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme ⋮ On some generalized equations with metrically C-increasing mappings: solvability and error bounds with applications to optimization ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ Steering exact penalty methods for nonlinear programming ⋮ Exact Penalty in Constrained Optimization and the Mordukhovich Basic Subdifferential ⋮ Exact penalty functions in isoperimetric problems ⋮ Two Classes of Smooth Objective Penalty Functions for Constrained Problems ⋮ On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems ⋮ Necessary and sufficient conditions for a penalty method to be exact ⋮ Smoothing Partially Exact Penalty Function of Biconvex Programming ⋮ Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints ⋮ Nonsmooth Optimization ⋮ A class of rank-two ellipsoid algorithms for convex programming ⋮ Exact penalization via dini and hadamard conditional derivatives ⋮ Global convergence and finite termination of a class of smooth penalty function algorithms ⋮ Acceleration of the leastpth algorithm for minimax optimization with engineering applications ⋮ An exact penalty function for nonlinear programming with inequalities ⋮ Optimization of electrical circuits ⋮ Exact penalty functions in nonlinear programming ⋮ Unnamed Item ⋮ Exact penalty functions and Lagrange multipliers ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ Optimizing sensor cover energy via DC programming ⋮ THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS ⋮ A first order, exact penalty function algorithm for equality constrained optimization problems ⋮ Necessary and sufficient condition for non-concave network utility maximisation ⋮ A smoothing-out technique for min—max optimization ⋮ A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function ⋮ Penalty functions in ε-programming and ε-minimax problems ⋮ Robust saddle-point criteria for multi-dimensional control optimisation problems with data uncertainty ⋮ Generic properties of the complementarity problem ⋮ Smoothing Approximation to the New Exact Penalty Function with Two Parameters ⋮ A column generation algorithm for nonlinear programming ⋮ Smoothing approximation to the lower order exact penalty function for inequality constrained optimization ⋮ An exact penalty function based on the projection matrix ⋮ Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates ⋮ Global optimization on convex sets ⋮ On the exactness of a class of nondifferentiable penalty functions ⋮ An external penalty-type method for multicriteria ⋮ An exact penalty approach to constrained minimization problems on metric spaces ⋮ Exact barrier function methods for Lipschitz programs ⋮ A new smoothing approach to exact penalty functions for inequality constrained optimization problems ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming ⋮ An approximate lower order penalty approach for solving second-order cone linear complementarity problems ⋮ Exactness and algorithm of an objective penalty function ⋮ Error bounds in mathematical programming ⋮ On the smoothing of the square-root exact penalty function for inequality constrained optimization ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ Benefits of noise in M-estimators: optimal noise level and probability density ⋮ A second-order smooth penalty function algorithm for constrained optimization problems ⋮ Second-order analysis of penalty function ⋮ Existence of exact penalty for constrained optimization problems in Hilbert spaces ⋮ A minimization method for the sum of a convex function and a continuously differentiable function ⋮ Exterior penalty in optimal control problem with state-control constraints ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems ⋮ On the convergence of a smooth penalty algorithm without computing global solutions ⋮ A globally convergent algorithm for exact penalty functions ⋮ A new class of copulas involved geometric distribution: estimation and applications ⋮ The Exactness Property of the Vector Exact l₁ Penalty Function Method in Nondifferentiable Invex Multiobjective Programming ⋮ An approach to solve local and global optimization problems based on exact objective filled penalty functions ⋮ A new exact exponential penalty function method and nonconvex mathematical programming ⋮ Statistical inferences for generalized Pareto distribution based on interior penalty function algorithm and bootstrap methods and applications in analyzing stock data ⋮ A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties ⋮ A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems ⋮ Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems ⋮ The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems ⋮ An estimation of exact penalty for infinite-dimensional inequality-constrained minimization problems ⋮ Models for multimode multicommodity location problems with interdepot balancing requirements ⋮ Global minimization of constrained problems with discontinuous penalty functions ⋮ Existence and stability of exact penalty for optimization problems with mixed constraints ⋮ Penalty function methods and a duality gap for invex optimization problems ⋮ An objective penalty function-based method for inequality constrained minimization problem ⋮ The exact penalty principle ⋮ An approximate exact penalty in constrained vector optimization on metric spaces

This page was built for publication: Non-Linear Programming Via Penalty Functions