Constrained Optimization Using a Nondifferentiable Penalty Function

DOI10.1137/0710063zbMath0259.90039OpenAlexW1994126718MaRDI QIDQ5675155

Andrew R. Conn

Publication date: 1973

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0710063

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (29)

Constrained Consensus-Based Optimization ⋮ Recent developments in constrained optimization ⋮ Discontinuous piecewise linear optimization ⋮ A minimization method for the sum of a convex function and a continuously differentiable function ⋮ A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems ⋮ The continuous quadrant penalty formulation of logical constraints ⋮ A globally convergent algorithm for exact penalty functions ⋮ A new exact exponential penalty function method and nonconvex mathematical programming ⋮ A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems ⋮ Discrete minimax problem: Algorithms and numerical comparisons ⋮ Prediction-correction alternating direction method for a class of constrained min-max problems ⋮ Global minimization of constrained problems with discontinuous penalty functions ⋮ Steering exact penalty methods for nonlinear programming ⋮ A network penalty method ⋮ Necessary and sufficient conditions for a penalty method to be exact ⋮ Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm ⋮ A smoothed penalty iteration for state constrained optimal control problems for partial differential equations ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ Numerically stable methods for quadratic programming ⋮ Nonlinear leastpth optimization and nonlinear programming ⋮ Minimization methods with constraints ⋮ On conditions for optimality of the nonlinearl 1 problem ⋮ The 𝒰-Lagrangian of a convex function ⋮ A lower bound for the controlling parameters of the exact penalty functions ⋮ A first order, exact penalty function algorithm for equality constrained optimization problems ⋮ Combined phase I—phase II methods of feasible directions ⋮ Exact penalty functions method for mathematical programming problems involving invex functions ⋮ A smoothing-out technique for min—max optimization ⋮ An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

This page was built for publication: Constrained Optimization Using a Nondifferentiable Penalty Function