Pages that link to "Item:Q4308550"

The following pages link to On Smoothing Exact Penalty Functions for Convex Constrained Optimization (Q4308550):

Displaying 50 items.

• A new smoothing approach to exact penalty functions for inequality constrained optimization problems (Q317135) (← links)
• An M-objective penalty function algorithm under big penalty parameters (Q328083) (← links)
• Smooth exact penalty functions. II: A reduction to standard exact penalty functions (Q331994) (← links)
• A second-order smooth penalty function algorithm for constrained optimization problems (Q354635) (← links)
• On the convergence of a smoothed penalty algorithm for semi-infinite programming (Q376724) (← links)
• On the convergence of a smooth penalty algorithm without computing global solutions (Q411033) (← links)
• A study of regularization techniques of nondifferentiable optimization in view of application to hemivariational inequalities (Q462996) (← links)
• A power penalty method for second-order cone nonlinear complementarity problems (Q492069) (← links)
• A penalty function method based on smoothing lower order penalty function (Q548295) (← links)
• A line search filter secant method for nonlinear equality constrained optimization (Q601901) (← links)
• Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data (Q683917) (← links)
• Smoothing of the lower-order exact penalty function for inequality constrained optimization (Q737061) (← links)
• Optimal covering of plane domains by circles via hyperbolic smoothing (Q813342) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• On the smoothing of the square-root exact penalty function for inequality constrained optimization (Q861516) (← links)
• On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
• On smoothing exact penalty functions for nonlinear constrained optimization problems (Q1032012) (← links)
• On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
• A new computational method for the functional inequality constrained minimax optimization problem (Q1356866) (← links)
• On penalty method for equilibrium problems in lexicographic order (Q1746010) (← links)
• An objective penalty function method for nonlinear programming. (Q1764582) (← links)
• A power penalty method for second-order cone linear complementarity problems (Q1785626) (← links)
• Smoothing approximation to the square-order exact penalty functions for constrained optimization (Q1790006) (← links)
• A class of smoothing functions for nonlinear and mixed complementarity problems (Q1815073) (← links)
• Smoothing methods for convex inequalities and linear complementarity problems (Q1924058) (← links)
• Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
• Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization (Q2018997) (← links)
• Simple algorithms for optimization on Riemannian manifolds with constraints (Q2019906) (← links)
• A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract (Q2023991) (← links)
• An approximate lower order penalty approach for solving second-order cone linear complementarity problems (Q2154446) (← links)
• A GA-based model selection for smooth twin parametric-margin support vector machine (Q2353751) (← links)
• Exactness and algorithm of an objective penalty function (Q2392750) (← links)
• Smoothed penalty algorithms for optimization of nonlinear models (Q2643624) (← links)
• Surrogate-based distributed optimisation for expensive black-box functions (Q2663899) (← links)
• Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique (Q2943826) (← links)
• A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems (Q3173503) (← links)
• Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems (Q4412389) (← links)
• Two Classes of Smooth Objective Penalty Functions for Constrained Problems (Q4634139) (← links)
• An exact lower order penalty function and its smoothing in nonlinear programming (Q4656058) (← links)
• Global convergence and finite termination of a class of smooth penalty function algorithms (Q4924100) (← links)
• The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems (Q5077161) (← links)
• Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems (Q5085235) (← links)
• Smoothing Partially Exact Penalty Function of Biconvex Programming (Q5149527) (← links)
• New Smoothing Approximations to Piecewise Smooth Functions and Applications (Q5379303) (← links)
• Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems (Q5409739) (← links)
• Penalty Methods for a Class of Non-Lipschitz Optimization Problems (Q5741071) (← links)
• The continuous quadrant penalty formulation of logical constraints (Q6068284) (← links)
• Global convergence of a class new smooth penalty algorithm for constrained optimization problem (Q6093365) (← links)
• Fixed-time consensus for multi-agent systems with objective optimization on directed detail-balanced networks (Q6155115) (← links)
• Distributed predefined-time optimal economic dispatch for microgrids (Q6606000) (← links)