Pages that link to "Item:Q4099842"

The following pages link to Combined Primal–Dual and Penalty Methods for Convex Programming (Q4099842):

Displaying 29 items.

• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
• Augmented Lagrangian methods for nonlinear programming with possible infeasibility (Q746818) (← links)
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
• Proximal point method and elliptic regularization (Q838049) (← links)
• Penalty function methods and a duality gap for invex optimization problems (Q923993) (← links)
• The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization (Q1004224) (← links)
• Duality in nonlinear programs using augmented Lagrangian functions (Q1090612) (← links)
• Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization (Q1131824) (← links)
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators (Q1198734) (← links)
• Multiplier methods: A survey (Q1223623) (← links)
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation (Q1235959) (← links)
• Convexification procedures and decomposition methods for nonconvex optimization problems (Q1251185) (← links)
• Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• On the twice differentiable cubic augmented Lagrangian (Q1908654) (← links)
• Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems (Q1945504) (← links)
• Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization (Q2029687) (← links)
• New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks (Q2433515) (← links)
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems (Q2487472) (← links)
• INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
• Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
• A multiplier method with automatic limitation of penalty growth (Q3050151) (← links)
• Accelerated convergence for the Powell/Hestenes multiplier method (Q3867567) (← links)
• Necessary and sufficient conditions for a penalty method to be exact (Q4090135) (← links)
• Convergence analysis of a proximal newton method¹ (Q4714551) (← links)
• Funciones penalidad y lagrangianos aumentados (Q4749606) (← links)
• Augmented Lagrangian methods for variational inequality problems (Q5189878) (← links)
• On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
• Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization (Q6181243) (← links)