Pages that link to "Item:Q1058460"

The following pages link to An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460):

Displaying 32 items.

• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• Method of conjugate subgradients with constrained memory (Q463369) (← links)
• Subgradient projection algorithm. II (Q797969) (← links)
• An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
• Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
• A method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185) (← links)
• Algorithms for optimization problems with exclusion constraints (Q1068724) (← links)
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm (Q1090621) (← links)
• Penalty-proximal methods in convex programming (Q1091267) (← links)
• A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
• Improving feasible directions for a class of nondifferentiable functions (Q1099079) (← links)
• A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
• An algorithm for calculating one subgradient of a convex function of two variables (Q1119340) (← links)
• An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
• The empirical performance of a polynomial algorithm for constrained nonlinear optimization (Q1309871) (← links)
• A simple algorithm for a class of nonsmooth convex-concave saddle-point problems (Q1785640) (← links)
• The method of analytic barriers with updating for minimization of a convex function subject to box contraints on the variables. (Q1852489) (← links)
• A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization (Q2060804) (← links)
• A linearized finite-difference method for the solution of some mixed concave and convex non-linear problems (Q2479164) (← links)
• An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
• A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
• (Q3343782) (← links)
• A Linearization Algorithm for Nonsmooth Minimization (Q3680622) (← links)
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
• A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379) (← links)
• (Q3972979) (← links)
• A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control (Q4563378) (← links)
• On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint (Q4971015) (← links)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
• An algorithm using Moreau-Yosida regularization for minimization of a nondifferentiable convex function (Q5259436) (← links)
• An Optimal Algorithm for Constrained Differentiable Convex Optimization (Q5408206) (← links)
• A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems (Q5470232) (← links)