The following pages link to Marc Teboulle (Q170029):
Displaying 50 items.
- (Q3057943) (← links)
- (Q3079664) (← links)
- A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems (Q3083329) (← links)
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions (Q3140001) (← links)
- (Q3174068) (← links)
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming (Q3198441) (← links)
- Lagrangian methods for composite optimization (Q3295561) (← links)
- Iterative Minimization Schemes for Solving the Single Source Localization Problem (Q3395023) (← links)
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares (Q3435006) (← links)
- On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l<sub>1</sub></i>unit ball (Q3635701) (← links)
- (Q3698647) (← links)
- Rate distortion theory with generalized information measures via convex programming duality (Q3755357) (← links)
- A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems (Q3826458) (← links)
- Entropic Proximal Mappings with Applications to Nonlinear Programming (Q4022026) (← links)
- Convergence of best phi -entropy estimates (Q4034473) (← links)
- (Q4197639) (← links)
- Upper Bounds on the Expected Value of a Convex Function Using Gradient and Conjugate Function Information (Q4207759) (← links)
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming (Q4229469) (← links)
- A regularized dual-based iterative method for a class of image reconstruction problems (Q4286698) (← links)
- Experimental validation of an optimization formulation of the human grasping quality sense (Q4365951) (← links)
- Convergence of Proximal-Like Algorithms (Q4376157) (← links)
- Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems (Q4443039) (← links)
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems (Q4509753) (← links)
- A Minimax Chebyshev Estimator for Bounded Error Estimation (Q4567756) (← links)
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742) (← links)
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems (Q4664041) (← links)
- Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization (Q4669783) (← links)
- Entropy-Like Proximal Methods in Convex Programming (Q4698101) (← links)
- Toeard a formulation of the human grasping quality sense (Q4698209) (← links)
- A simple Duality Proof for Quadratically Constrained Entropy Functionals and Extension to Convex Constraints (Q4730599) (← links)
- (Q4733681) (← links)
- (Q4779970) (← links)
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming (Q4864878) (← links)
- Multiplicative Interior Gradient Methods for Minimization over the Nonnegative Orthant (Q4874956) (← links)
- A Conjugate Duality Scheme Generating a New Class of Differentiable Duals (Q4895612) (← links)
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint (Q4912757) (← links)
- (Q4945767) (← links)
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels (Q4951043) (← links)
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization (Q4979868) (← links)
- Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems (Q5003218) (← links)
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons (Q5025784) (← links)
- Faster Lagrangian-Based Methods in Convex Optimization (Q5062120) (← links)
- Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints (Q5108481) (← links)
- (Q5146243) (← links)
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence (Q5219695) (← links)
- (Q5314955) (← links)
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems (Q5358406) (← links)
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems (Q5366152) (← links)
- A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization (Q5387987) (← links)
- AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT (Q5427665) (← links)
