The following pages link to (Q4830373):
Displaying 50 items.
- The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem (Q5043038) (← links)
- Subgradient method with feasible inexact projections for constrained convex optimization problems (Q5045169) (← links)
- A new constrained optimization model for solving the nonsymmetric stochastic inverse eigenvalue problem (Q5051477) (← links)
- (Q5096547) (← links)
- Duality Gap Estimation via a Refined Shapley--Folkman Lemma (Q5107209) (← links)
- (Q5116194) (← links)
- Inexact proximal stochastic second-order methods for nonconvex composite optimization (Q5135256) (← links)
- (Q5142530) (← links)
- The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
- Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming (Q5221264) (← links)
- Optimality Conditions for Nonconvex Constrained Optimization Problems (Q5238081) (← links)
- Asynchronous Algorithms for Computing Equilibrium Prices in a Capital Asset Pricing Model (Q5241277) (← links)
- An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs (Q5244155) (← links)
- On the Computation of Set-Induced Control Lyapunov Functions for Continuous-Time Systems (Q5254888) (← links)
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296) (← links)
- OPTIMAL MEAN–VARIANCE REINSURANCE WITH COMMON SHOCK DEPENDENCE (Q5369466) (← links)
- Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming (Q5853719) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications (Q5861980) (← links)
- Single Bregman projection method for solving variational inequalities in reflexive Banach spaces (Q5867283) (← links)
- A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization (Q5869816) (← links)
- A zonotopic framework for functional abstractions (Q5962973) (← links)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)
- Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)
- Circumcentric directions of cones (Q6043123) (← links)
- Nonparametric estimation of distributions and diagnostic accuracy based on group‐tested results with differential misclassification (Q6047752) (← links)
- Second-order enhanced optimality conditions and constraint qualifications (Q6050163) (← links)
- Weighted Bayesian bootstrap for scalable posterior distributions (Q6059510) (← links)
- Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems (Q6061270) (← links)
- Improved variance reduction extragradient method with line search for stochastic variational inequalities (Q6064028) (← links)
- Optimal consensus for uncertain high‐order multi‐agent systems by output feedback (Q6071456) (← links)
- An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints (Q6072951) (← links)
- Maximal Monotonicity and Cyclic Involutivity of Multiconjugate Convex Functions (Q6076856) (← links)
- Optimality Conditions for E-Convex Interval-Valued Programming Problem Using gH-Symmetrical Derivative (Q6077942) (← links)
- A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint (Q6081040) (← links)
- The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds (Q6085820) (← links)
- A varying-parameter fixed-time gradient-based dynamic network for convex optimization (Q6091316) (← links)
- An asynchronous subgradient-proximal method for solving additive convex optimization problems (Q6093360) (← links)
- Game-theoretical approach for task allocation problems with constraints (Q6096389) (← links)
- A conforming virtual element method based on unfitted meshes for the elliptic interface problem (Q6111396) (← links)
- Local navigation-like functions for safe robot navigation in bounded domains with unknown convex obstacles (Q6119729) (← links)
- Theoretical analysis of classic and capacity constrained fuzzy clustering (Q6125180) (← links)
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
- Deep learning for natural language processing: a survey (Q6132497) (← links)
- Event-triggered distributed Nash equilibrium seeking over directed graphs and its application to power management (Q6136405) (← links)
- Polyhedral estimation of \(\mathcal{L}_1\) and \(\mathcal{L}_\infty\) incremental gains of nonlinear systems (Q6137804) (← links)
- Characterizing shadow price via Lagrange multiplier for nonsmooth problem (Q6151006) (← links)
- Directional shadow price in linearly constrained nonconvex optimization models (Q6154402) (← links)
- A weighted gradient model with total variation regularization for multi-focus image fusion (Q6170091) (← links)
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization (Q6175706) (← links)
