On Smoothingl1Exact Penalty Function for Constrained Optimization Problems

DOI10.1080/01630563.2018.1483948zbMath1420.90070OpenAlexW2906738139MaRDI QIDQ4634172

Felix T. S. Chan, Chuangyin Dang, Xin-Sheng Xu, Yong-Li Wang

Publication date: 7 May 2019

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2018.1483948

zbMATH Keywords

smoothing techniqueconstrained optimization problems$l_1$ exact penalty function

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality

Cites Work

• A new smoothing approach to exact penalty functions for inequality constrained optimization problems
• Smooth exact penalty functions. II: A reduction to standard exact penalty functions
• A smoothing Newton method for the second-order cone complementarity problem.
• A second-order smooth penalty function algorithm for constrained optimization problems
• A log-exponential smoothing method for mathematical programs with complementarity constraints
• Parallel algorithms for large-scale linearly constrained minimization problem
• A penalty function method based on smoothing lower order penalty function
• An accurate active set Newton algorithm for large scale bound constrained optimization.
• Parallel SSLE algorithm for large scale constrained optimization
• A smoothing Newton method for second-order cone optimization based on a new smoothing function
• A new one-step smoothing Newton method for second-order cone programming.
• Smoothing of the lower-order exact penalty function for inequality constrained optimization
• On the smoothing of the square-root exact penalty function for inequality constrained optimization
• An active set quasi-Newton method with projected search for bound constrained minimization
• On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem
• A decomposition method for large-scale box constrained optimization
• Smoothing approximation to the square-order exact penalty functions for constrained optimization
• Study on stochastic linear quadratic optimal control with quadratic and mixed terminal state constraints
• Study on indefinite stochastic linear quadratic optimal control with inequality constraint
• Smoothing methods for convex inequalities and linear complementarity problems
• A simple smooth exact penalty function for smooth optimization problem
• A new class of smoothing functions and a smoothing Newton method for complementarity problems
• Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
• Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
• A penalty function algorithm with objective parameters for nonlinear mathematical programming
• A Nonlinear Lagrangian Approach to Constrained Optimization Problems
• Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs
• A robust SQP method based on a smoothing lower order penalty function†
• Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
• A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
• An exact lower order penalty function and its smoothing in nonlinear programming
• Decreasing Functions with Applications to Penalization
• Extended Lagrange And Penalty Functions in Continuous Optimization^*
• Non-Linear Programming Via Penalty Functions
• A new non-interior continuation method for second-order cone programming
• Duality and exact penalization for vector optimization via augmented Lagrangian

This page was built for publication: On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems