Pages that link to "Item:Q4015448"

The following pages link to New Results on a Continuously Differentiable Exact Penalty Function (Q4015448):

Displaying 31 items.

• Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• A smooth method for the finite minimax problem (Q689121) (← links)
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
• Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities (Q868635) (← links)
• Exact augmented Lagrangian function for nonlinear programming problems with inequality constraints (Q957634) (← links)
• On differentiable exact penalty functions (Q1065714) (← links)
• A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set (Q1319684) (← links)
• On the role of continuously differentiable exact penalty functions in constrained global optimization (Q1330806) (← links)
• An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties (Q1356094) (← links)
• Smooth transformation of the generalized minimax problem (Q1372537) (← links)
• On the continuity of point-to-set mappings related to the penalty function method (Q1390388) (← links)
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812) (← links)
• Augmented Lagrangian and exact penalty methods for quasi-variational inequalities (Q1744910) (← links)
• A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness (Q1752649) (← links)
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
• A simple smooth exact penalty function for smooth optimization problem (Q1936573) (← links)
• A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties (Q1949585) (← links)
• A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
• A new class of exact penalty functions and penalty algorithms (Q2442639) (← links)
• An exact penalty-Lagrangian approach for large-scale nonlinear programming (Q2996800) (← links)
• A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization (Q3179268) (← links)
• A robust SQP method based on a smoothing lower order penalty function† (Q3622004) (← links)
• (Q3677520) (← links)
• ON DUAL DIFFERENTIABLE EXACT PENALTY FUNCTIONS FOR EQUALITY CONSTRAINED OPTIMIZATION (Q3705230) (← links)
• A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379) (← links)
• An active set sequential quadratic programming algorithm for nonlinear optimisation (Q5482578) (← links)
• Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming (Q6052061) (← links)