Pages that link to "Item:Q3768690"

The following pages link to An exact penalty function method with global convergence properties for nonlinear programming problems (Q3768690):

Displaying 50 items.

• An M-objective penalty function algorithm under big penalty parameters (Q328083) (← links)
• The use of grossone in mathematical programming and operations research (Q440662) (← links)
• A power penalty method for second-order cone nonlinear complementarity problems (Q492069) (← links)
• Global and local convergence of a penalty-free method for nonlinear programming (Q493442) (← 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)
• Unified theory of augmented Lagrangian methods for constrained global optimization (Q839330) (← links)
• On the smoothing of the square-root exact penalty function for inequality constrained optimization (Q861516) (← links)
• Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities (Q868635) (← links)
• On the exactness of a class of nondifferentiable penalty functions (Q1090620) (← links)
• New results on a class of exact augmented Lagrangians (Q1093533) (← links)
• Random tunneling by means of acceptance-rejection sampling for global optimization (Q1106731) (← links)
• An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
• A new successive quadratic programming algorithm (Q1210225) (← links)
• A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set (Q1319684) (← links)
• A parallel method for finding the global minimum of univariate functions (Q1321483) (← links)
• Nonlinear complementarity as unconstrained and constrained minimization (Q1321650) (← links)
• On the role of continuously differentiable exact penalty functions in constrained global optimization (Q1330806) (← links)
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties (Q1356094) (← links)
• Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems (Q1706415) (← links)
• On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
• An objective penalty function method for nonlinear programming. (Q1764582) (← links)
• A power penalty method for second-order cone linear complementarity problems (Q1785626) (← links)
• Exact barrier function methods for Lipschitz programs (Q1895790) (← links)
• A Newton-type method for positive-semidefinite linear complementarity problems (Q1905937) (← 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)
• An objective penalty function method for biconvex programming (Q2052381) (← links)
• Optimum dimensional synthesis of planar mechanisms with geometric constraints (Q2121228) (← links)
• Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
• An approximate lower order penalty approach for solving second-order cone linear complementarity problems (Q2154446) (← links)
• Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems (Q2222129) (← links)
• A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
• New simple exact penalty function for constrained minimization (Q2376164) (← links)
• A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
• Exactness and algorithm of an objective penalty function (Q2392750) (← links)
• Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications (Q2422876) (← links)
• A new class of exact penalty functions and penalty algorithms (Q2442639) (← links)
• An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
• An exact penalty-Lagrangian approach for large-scale nonlinear programming (Q2996800) (← links)
• THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS (Q3069758) (← links)
• Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization (Q3300857) (← links)
• Exact penalty functions and Lagrange multipliers (Q3360672) (← links)
• A differentiable exact penalty function for bound constrained quadratic programming problems (Q3362090) (← links)
• (Q3812052) (← links)
• An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables (Q3835628) (← links)
• (Q4252704) (← links)
• (Q4693608) (← links)
• Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding (Q4837935) (← links)
• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems (Q4927306) (← links)