Pages that link to "Item:Q4404679"

The following pages link to An exact penalty function for nonlinear programming with inequalities (Q4404679):

Displaying 45 items.

• The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (Q331995) (← links)
• The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems (Q440840) (← links)
• Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space (Q452273) (← links)
• An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity (Q489100) (← links)
• Exact penalties for variational inequalities with applications to nonlinear complementarity problems (Q616794) (← links)
• A new exact exponential penalty function method and nonconvex mathematical programming (Q632914) (← links)
• On equivalence between optimality criteria and projected gradient methods with application to topology optimization problem (Q812990) (← links)
• Projected quasi-Newton algorithm with trust region for constrained optimization (Q911465) (← links)
• Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
• Exact penalty functions method for mathematical programming problems involving invex functions (Q1027576) (← links)
• A new augmented Lagrangian function for inequality constraints in nonlinear programming problems (Q1148810) (← links)
• An economical method of calculating Lagrange multiplier estimates for nonlinear programming problems when many of the constraints are bounds on the variables (Q1226038) (← links)
• A second-order method for the general nonlinear programming problem (Q1245156) (← links)
• An algorithm for minimizing a differentiable function subject to box constraints and errors (Q1249930) (← links)
• A geometric method in nonlinear programming (Q1253613) (← links)
• A trust region algorithm for nonsmooth optimization (Q1341571) (← 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)
• Vector exponential penalty function method for nondifferentiable multiobjective programming problems (Q1746707) (← links)
• A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness (Q1752649) (← links)
• Geometric approach to Fletcher's ideal penalty function (Q1893322) (← links)
• A simple smooth exact penalty function for smooth optimization problem (Q1936573) (← links)
• Global minimization of constrained problems with discontinuous penalty functions (Q1962979) (← links)
• On the finite element solution of frictionless contact problems using an exact penalty approach (Q2021156) (← links)
• A class of augmented Lagrangians for equality constraints in nonlinear programming problems (Q2369125) (← links)
• New simple exact penalty function for constrained minimization (Q2376164) (← links)
• Continuous-time gradient-like descent algorithm for constrained convex unknown functions: penalty method application (Q2423608) (← links)
• A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems (Q2435021) (← links)
• A new class of exact penalty functions and penalty algorithms (Q2442639) (← links)
• Nonlinear programming using minimax techniques (Q2560772) (← links)
• An analysis of reduced Hessian methods for constrained optimization (Q2640451) (← links)
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
• The Exactness Property of the Vector Exact <i>l</i>₁ Penalty Function Method in Nondifferentiable Invex Multiobjective Programming (Q2964199) (← links)
• A multiplier method with automatic limitation of penalty growth (Q3050151) (← links)
• THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS (Q3069758) (← links)
• Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization (Q3300858) (← links)
• Further study on a class of augmented Lagrangians of Di Pillo and Grippo in nonlinear programming (Q3409771) (← links)
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions (Q3734178) (← links)
• The computation of Lagrange-multiplier estimates for constrained minimization (Q3858049) (← links)
• Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming (Q4149245) (← links)
• Nonlinear leastpth optimization and nonlinear programming (Q4152045) (← links)
• A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
• Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints (Q5157969) (← links)
• On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems (Q6059887) (← links)
• Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems (Q6066599) (← links)