Pages that link to "Item:Q4229469"

The following pages link to An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming (Q4229469):

Displaying 13 items.

• An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
• Properties of the augmented Lagrangian in nonlinear semidefinite optimization (Q868537) (← links)
• Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds (Q1014028) (← links)
• On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
• Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622) (← links)
• An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds (Q1955549) (← links)
• Convergence of the exponentiated gradient method with Armijo line search (Q2420800) (← links)
• A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems (Q2489329) (← links)
• Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved (Q2514640) (← links)
• Interior projection-like methods for monotone variational inequalities (Q2570999) (← links)
• Penalty/Barrier multiplier algorthm for semidefinit programming^∗ (Q4514285) (← links)
• First-order methods for convex optimization (Q6169988) (← links)