Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities

Mathematics

• Constrained Optimization 100%
• Order 100%
• Bounds 60%
• Objective Function 60%
• Constraints 40%
• Algorithm 40%
• Regularization 40%
• Feasible Set 40%
• Points 20%
• Approximates 20%
• Nonlinear 20%
• Derivatives 20%
• Terms 20%
• Critical Point 20%
• Worst Case 20%
• Lipschitz 20%

Computer Science

• Models 100%
• Constrained Optimization 100%
• Complexity 100%
• Objective Function 60%
• Algorithms 40%
• Evaluation 40%
• Computation 20%
• Convex Constraint 20%
• Optimization Problem 20%
• Bound Constraint 20%
• Critical Point 20%
• Regularization 20%
• Regularization Term 20%