Pages that link to "Item:Q4162980"

The following pages link to Algorithms for nonlinear constraints that use lagrangian functions (Q4162980):

Displaying 35 items.

• Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
• Structural optimization strategies for simple and integrally stiffened plates and shells (Q3576550) (← links)
• A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation† (Q3683985) (← links)
• A globally convergent version of a general recursive algorithm for nonlinear programming (Q3741433) (← links)
• A two-stage feasible directions algorithm for nonlinear constrained optimization (Q3762086) (← links)
• On the local and global convergence of a reduced Quasi-Newton method¹ (Q3832325) (← links)
• Quasi-Newtonian methods of constrained optimization (Q3899826) (← links)
• A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function (Q3934150) (← links)
• Some examples of cycling in variable metric methods for constrained minimization (Q4187603) (← links)
• Solving nonlinear programming problems with very many constraints (Q4327941) (← links)
• An approach to multi-start clustering for global optimization with non-linear constraints (Q4530126) (← links)
• A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
• Block BFGS Methods (Q4641646) (← links)
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization (Q4653552) (← links)
• The linearization method (Q4729625) (← links)
• Numerical performance of two formulations of truss topology optimization (Q4849499) (← links)
• A robust multi-batch L-BFGS method for machine learning (Q4972551) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
• A new alternating direction trust region method based on conic model for solving unconstrained optimization (Q5009158) (← links)
• A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
• Quasi-Newton methods for machine learning: forget the past, just sample (Q5058389) (← links)
• The first open channel for yield-stress fluids in porous media (Q5150851) (← links)
• Stochastic proximal quasi-Newton methods for non-convex composite optimization (Q5198046) (← links)
• A comparison of distributed MPC schemes on a hydro‐power plant benchmark (Q5254102) (← links)
• SOME ASPECTS OF OPTIMUM DESIGN OF ELECTROMAGNETIC DEVICES (Q5288310) (← links)
• High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
• A model-free shrinking-dimer saddle dynamics for finding saddle point and solution landscape (Q6072373) (← links)
• Transformed primal-dual methods for nonlinear saddle point systems (Q6087387) (← links)
• An overview of stochastic quasi-Newton methods for large-scale machine learning (Q6097379) (← links)
• YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming (Q6104218) (← links)
• Proximal quasi-Newton method for composite optimization over the Stiefel manifold (Q6159020) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
• An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold (Q6624434) (← links)
• An augmented Lagrangian method for state constrained linear parabolic optimal control problems (Q6636783) (← links)