On solving convex optimization problems with linear ascending constraints

Keyphrases

• Convex Optimization Problem 100%
• Dual Method 100%
• Optim 50%
• Numerical Experiments 50%
• Gradient Projection 50%
• Worst-case Complexity 50%
• Finite number of Iterations 50%

Mathematics

• Objective Function 100%
• Worst Case 50%
• Test Problem 50%
• Projection Method 50%
• Finite Number 50%
• Numerical Experiment 50%