Pages that link to "Item:Q2558160"
From MaRDI portal
The following pages link to The multiplier method of Hestenes and Powell applied to convex programming (Q2558160):
Displaying 50 items.
- A sparse nonlinear optimization algorithm (Q1337223) (← links)
- Convexity of the implicit Lagrangian (Q1367805) (← links)
- Solution of thin film magnetization problems in type-II superconductivity (Q1658558) (← links)
- An alternating direction and projection algorithm for structure-enforced matrix factorization (Q1687315) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- Value-estimation function method for constrained global optimization (Q1807822) (← links)
- Johri's general dual, the Lagrangian dual, and the surrogate dual (Q1847162) (← links)
- Local analysis of a new multipliers method (Q1848393) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- Zero duality gap for a class of nonconvex optimization problems (Q1897453) (← links)
- A genetic algorithm based augmented Lagrangian method for constrained optimization (Q1935579) (← links)
- Regularization methods for optimization problems with probabilistic constraints (Q1949268) (← links)
- Parameterized level-set based topology optimization method considering symmetry and pattern repetition constraints (Q1986361) (← links)
- A truly variationally consistent and symmetric mortar-based contact formulation for finite deformation solid mechanics (Q1986409) (← links)
- Level set based shape optimization using trimmed hexahedral meshes (Q1986809) (← links)
- A simple and feasible method for a class of large-scale \(l^1\)-problems (Q2006233) (← links)
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency (Q2070362) (← links)
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming (Q2090426) (← links)
- Randomized shortest paths with net flows and capacity constraints (Q2127057) (← links)
- On the best achievable quality of limit points of augmented Lagrangian schemes (Q2138411) (← links)
- Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants (Q2139269) (← links)
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems (Q2181561) (← links)
- Solving Lagrangian variational inequalities with applications to stochastic programming (Q2189448) (← links)
- The rate of convergence of proximal method of multipliers for equality constrained optimization problems (Q2193005) (← links)
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
- Three-dimensional topology optimization of a fluid-structure system using body-fitted mesh adaption based on the level-set method (Q2240376) (← links)
- On the combination of the multiplier method of Hestenes and Powell with Newton's method (Q2264406) (← links)
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems (Q2350402) (← links)
- A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (Q2358024) (← links)
- A class of augmented Lagrangians for equality constraints in nonlinear programming problems (Q2369125) (← links)
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function (Q2372014) (← links)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (Q2467167) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems (Q2487472) (← links)
- A nonlinear Lagrangian for constrained optimization problems (Q2511046) (← links)
- An augmented Lagrangian ant colony based method for constrained optimization (Q2515074) (← links)
- A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
- Decomposition for structured convex programs with smooth multiplier methods (Q2572336) (← links)
- An efficient augmented Lagrangian method with applications to total variation minimization (Q2636603) (← links)
- Design of biased random walks on a graph with application to collaborative recommendation (Q2669314) (← links)
- A two-level distributed algorithm for nonconvex constrained optimization (Q2696920) (← links)
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
- Lagrange optimality system for a class of nonsmooth convex optimization (Q2810115) (← links)
- Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
- Estimation of parameter functions in ordinary differential equations with a stage structure: a linear case (Q2938561) (← links)
- An augmented Lagrangian trust region method for equality constrained optimization (Q2943835) (← links)
- An alternating direction method for total variation denoising (Q2943837) (← links)
- Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← links)
- A proximal augmented Lagrangian method for equilibrium problems (Q3225833) (← links)
