The following pages link to Jefferson G. Melo (Q415384):
Displaying 28 items.
- Subgradient method for convex feasibility on Riemannian manifolds (Q415385) (← links)
- (Q607891) (redirect page) (← links)
- Duality and exact penalization for general augmented Lagrangians (Q607892) (← links)
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers (Q725878) (← links)
- A Newton conditional gradient method for constrained nonlinear systems (Q730572) (← links)
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility (Q746818) (← links)
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians (Q1955564) (← links)
- A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems (Q2181594) (← links)
- An inexact proximal generalized alternating direction method of multipliers (Q2191781) (← links)
- A primal dual modified subgradient algorithm with sharp Lagrangian (Q2268932) (← links)
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms (Q2301141) (← links)
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis (Q2317847) (← links)
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds (Q2363571) (← links)
- Iteration-complexity analysis of a generalized alternating direction method of multipliers (Q2633539) (← links)
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework (Q2968178) (← links)
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems (Q4963666) (← links)
- A proximal gradient splitting method for solving convex vector optimization problems (Q5034925) (← links)
- Projection-free accelerated method for convex optimization (Q5038178) (← links)
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM (Q5221273) (← links)
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)
- The exact penalty map for nonsmooth and nonconvex optimization (Q5248198) (← links)
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function (Q5883320) (← links)
- Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints (Q6199284) (← links)
- A Relative Inexact Proximal Gradient Method With an Explicit Linesearch (Q6530896) (← links)
- A Proximal Gradient Method with an Explicit Line search for Multiobjective Optimization (Q6530897) (← links)
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization (Q6568923) (← links)
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems (Q6596342) (← links)
