On the convergence of a smooth penalty algorithm without computing global solutions

DOI10.1155/2012/620949MaRDI QIDQ411033zbMATH OpenOpenAlexWikidataFDO

Authors Bingzhuang Liu, Changyu Wang, Wenling Zhao

Publication date 4 April 2012

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/620949

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Recommendations

• Global convergence of a class smooth penalty algorithm of constrained optimization problem
• Global convergence and finite termination of a class of smooth penalty function algorithms
• Global convergence of a class new smooth penalty algorithm for constrained optimization problem
• A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
• A new class of penalty functions and a penalty algorithm

Cites work

• scientific article; zbMATH DE number 4119957 (Why is no real title available?)
• A class of smoothing functions for nonlinear and mixed complementarity problems
• A nonlinear programming algorithm based on non-coercive penalty functions
• A smoothing-out technique for min—max optimization
• An exact lower order penalty function and its smoothing in nonlinear programming
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• Non-Linear Programming Via Penalty Functions
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• On the smoothing of the square-root exact penalty function for inequality constrained optimization
• Smoothed penalty algorithms for optimization of nonlinear models
• Smoothing methods for convex inequalities and linear complementarity problems
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints

Cited in

(3)

• Global convergence of a class smooth penalty algorithm of constrained optimization problem
• Exact penalization in stochastic programming -- calmness and constraint qualification
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems

This page was built for publication: On the convergence of a smooth penalty algorithm without computing global solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411033)