A second-order smooth penalty function algorithm for constrained optimization problems
From MaRDI portal
Publication:354635
DOI10.1007/S10589-012-9504-9zbMATH Open1273.90208OpenAlexW2067011531MaRDI QIDQ354635FDOQ354635
Zhiqing Meng, R. Shen, Jianwu Sun, Xinsheng Xu, Liguo Huang
Publication date: 19 July 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9504-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smoothing approximations to nonsmooth optimization problems
- Non-Linear Programming Via Penalty Functions
- Semismooth Newton methods for solving semi-infinite programming problems
- Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- An exact lower order penalty function and its smoothing in nonlinear programming
- A nonlinear Lagrangian approach to constrained optimization problems
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Decreasing Functions with Applications to Penalization
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Duality and exact penalization for vector optimization via augmented Lagrangian
- A globally convergent algorithm for exact penalty functions
- Smoothing methods for convex inequalities and linear complementarity problems
- A robust SQP method based on a smoothing lower order penalty functionβ
- Discontinuous Optimization by Smoothing
Cited In (12)
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
- Second-order smoothing approximation to \(l_1\) exact penalty function for nonlinear constrained optimization problems
- On Smoothingl1Exact Penalty Function for Constrained Optimization Problems
- A novel penalty function method for semivectorial bilevel programming problem
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- Smoothing Partially Exact Penalty Function of Biconvex Programming
- Smoothing Approximation to the New Exact Penalty Function with Two Parameters
- A probability constrained dynamic switching optimization method for the energy dispatch strategy of hybrid power systems with renewable energy resources and uncertainty
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- Title not available (Why is that?)
- An objective penalty function-based method for inequality constrained minimization problem
Recommendations
- A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems π π
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems π π
- Smoothing approximation to the square-order exact penalty functions for constrained optimization π π
- Some theoretical limitations of second-order algorithms for smooth constrained optimization π π
- Second-order smoothing approximation to \(l_1\) exact penalty function for nonlinear constrained optimization problems π π
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: A second-order smooth penalty function algorithm for constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354635)