A second-order smooth penalty function algorithm for constrained optimization problems
From MaRDI portal
(Redirected from Publication:354635)
Recommendations
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- Second-order smoothing approximation to \(l_1\) exact penalty function for nonlinear constrained optimization problems
- A smoothing exact penalty function algorithm for nonlinear constrained optimization problems
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
- A second-order smoothing approximation to lower order exact penalty functions
- Publication:3476212
- Smoothing approximation to the square-order exact penalty functions for constrained optimization
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- scientific article; zbMATH DE number 6263697
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
Cites work
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 4119957 (Why is no real title available?)
- A globally convergent algorithm for exact penalty functions
- A nonlinear Lagrangian approach to constrained optimization problems
- A robust SQP method based on a smoothing lower order penalty function†
- An exact lower order penalty function and its smoothing in nonlinear programming
- Decreasing Functions with Applications to Penalization
- Discontinuous Optimization by Smoothing
- Duality and exact penalization for vector optimization via augmented Lagrangian
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Non-Linear Programming Via Penalty Functions
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
- Semismooth Newton methods for solving semi-infinite programming problems
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Smoothing approximations to nonsmooth optimization problems
- Smoothing methods for convex inequalities and linear complementarity problems
Cited in
(15)- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
- 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
- A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
- An objective penalty function-based method for inequality constrained minimization problem
- Smoothing approximation to \(l_{1}\) exact penalty function for constrained optimization problems
- 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 approximation to \(l_1\) exact penalty function for nonlinear constrained optimization problems
- scientific article; zbMATH DE number 4213757 (Why is no real title available?)
- Smoothing approximation to the new exact penalty function with two parameters
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Smoothing partially exact penalty function of biconvex programming
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)
