Penalty and Barrier Methods: A Unified Framework
From MaRDI portal
Publication:4943614
DOI10.1137/S1052623497324825zbMath0953.90045OpenAlexW1998288832MaRDI QIDQ4943614
Publication date: 19 March 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497324825
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)
Related Items
Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios ⋮ On the convergence of a smoothed penalty algorithm for semi-infinite programming ⋮ On almost smooth functions and piecewise smooth functions ⋮ Penalty and barrier methods for convex semidefinite programming ⋮ Minimization of isotonic functions composed of Fractions ⋮ A Self-Concordant Interior Point Approach for Optimal Control with State Constraints ⋮ Global convergence of a class new smooth penalty algorithm for constrained optimization problem ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ Optimal control by deep learning techniques and its applications on epidemic models ⋮ Statistical inferences for generalized Pareto distribution based on interior penalty function algorithm and bootstrap methods and applications in analyzing stock data ⋮ Some useful inequalities via trace function method in Euclidean Jordan algebras ⋮ An estimation of exact penalty for infinite-dimensional inequality-constrained minimization problems ⋮ General primal-dual penalty/barrier path-following Newton methods for nonlinear programming ⋮ An approximate exact penalty in constrained vector optimization on metric spaces ⋮ Compensated convexity and its applications ⋮ An approximate exact penalty for vector inequality-constrained minimization problems ⋮ A homotopy method based on penalty function for nonlinear semidefinite programming ⋮ On some properties and an application of the logarithmic barrier method ⋮ A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness ⋮ Global convergence and finite termination of a class of smooth penalty function algorithms ⋮ A new augmented Lagrangian approach to duality and exact penalization ⋮ A general class of penalty/barrier path-following Newton methods for nonlinear programming ⋮ Smooth convex approximation to the maximum eigenvalue function ⋮ Approximate augmented Lagrangian functions and nonlinear semidefinite programs ⋮ Curiosities and counterexamples in smooth convex optimization
This page was built for publication: Penalty and Barrier Methods: A Unified Framework
