Keywords: 12D15; 14P99; 52B20; 90C25; Certificate; Geometric programming; Nonnegative polynomial; Semidefinite programming; Sum of nonnegative circuit polynomials; Sum of squares; Triangulation;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: Compressed sensing; Moreau proximal smoothing; Accelerated alternating minimization; Sparse recovery; Total variation; 94A12; 90C25; 68U10;
Keywords: 90C25; Power system security; Optimization methods; Load shedding; Dispatching; Power system dynamic stability;
Keywords: 90C25; 52A20; 15A39; Cone; Convex; Polar; Hyperplane; Separation;
Keywords: Semi-supervised regression; Quadratic loss; Ga^teaux derivative; Learning rate; 41A25; 90C25; 68Q32;
Keywords: 90C25; 93D20; 90C30; 90C46; Neural network; Nonlinear semidefinite programming; Convex optimization; Stability; Convergence;
Keywords: Convex ensemble learning; Incremental subgradient method; Fixed point; Quasi-nonexpansive mapping; 65K05; 68Q32; 90C25;
Keywords: 49K99; 26A33; 39A99; 90C25; Multi-agent systems; Emergent behavior; Consensus; Fractional-order systems; Optimal control;
Keywords: Convex clustering; Alternating Direction Method of Multipliers; Metric learning; Unsupervised learning; 62H30; 90C25; 68T10;
Keywords: 90C25; Copositive programming; Completely positive matrix; cp-factorization;
Keywords: nonsmooth multiobjective programming problem with the multiple interval-objective function; Fritz John necessary optimality conditions; Karush-Kuhn-Tucker necessary optimality conditions; (weakly) LU-efficient solution; Mond-Weir duality; 90C25; 90C29; 90
Keywords: ROF total variation; Fixed-point algorithm; Split Bregman; Image denoising; 65T60; 90C25; 68U10;
Keywords: 37N40; 46N10; 49M30; 65K05; 65K10; 90B50; 90C25; Asymptotic control; Convex optimization; Hierarchical minimization; Inertial gradient dynamics; Lyapunov analysis; Weakly coupled wave equations;
Keywords: 17C20; 17C30; 52A41; 90C25; Spectral sets; Spectral functions; Euclidean Jordan algebra; Algebra automorphisms; Majorization; Schur-convexity; Transfer principle; Metaformula;
Keywords: 94A20; 94A12; 60B20; 90C25; 81P50; Low rank matrix recovery; Quantum state tomography; Phase retrieval; Convex optimization; Complex projective designs; Random measurements; Matrix completion;
Keywords: 49J52; 49M37; 90C20; 90C25; 90C30Approximate subgradient; Bundle method; Convex optimization; Nonlinear programming; Nonsmooth optimization; Proximal bundle method
Keywords: General split feasibility problems; nonexpansive mappings; Hilbert space; strong convergence; 90C25; 47H09; 47J25;
Keywords: 90C25; 90C33; 65K10; 65K15Non-monotonicity; Equilibria; Extragradient method; Projection algorithm; Armijo linesearch
Keywords: 15A15; 15A45; 90C25; 68Q25; Mixed discriminant; Scaling; Algorithm; Concentration;
Keywords: Unilateral constraint; Hertzian contact; Hyperelasticity; Projection iterative method; Primal dual active set; Augmented Lagrangian74M15; 74G15; 74B05; 74B20; 74S30; 49M15; 90C53; 90C25; 65K15
Keywords: primary; 52A20; 90C25; secondary; 94A12; Compressed sensing; Convex geometry; Grassmannian condition number; Sparse recovery;
Keywords: Compressed sensing; Multiple measurement vectors; Joint sparsity; Row sparse matrices; Sparse recovery; Alternating direction method; 90C25; 90C59; 15A52; 52A41; 65J22; 15A29;
Keywords: 90C25; 90C26; 90C90Utility-based bandwidth allocation problem; Quasi-nonexpansive mapping; Nonexpansive mapping; Fixed point optimization algorithm
Keywords: 90C25; 90C30; 90C33Second-order cone; Complementarity problem; Power penalty method; Exponential convergence rate
Keywords: 90C22; 90C25; 52C25; 05C62Farkas lemma; Bar frameworks; Dimensional rigidity; Universal rigidity; Facial reduction; Semidefinite programming; Stress matrices
Keywords: 90C25; 90C27; 65K10Sparse recovery on Euclidean Jordan algebra; Nuclear norm minimization; Restricted isometry property; Null space property; s-goodness; Exact and stable recovery
Keywords: Krasnoselskii iteration; Strong convergence; Minimum norm solution; Pseudomonotone mappings; Lipschitzian mappings; Seepage theory47H06; 47H10; 49M05; 90C25
Keywords: 90C26; 90C25; 90C59; 15A06; 15A48Continuous Lyapunov equation; Discrete Lyapunov equation; Lowest-rank solution; Symmetric cone; Polynomial-time solvability
Keywords: 90C10; 90C25; 90C90; 91C20Constrained clustering; Convex maximization; Integer programming; Land consolidation
Quasi-Newton algorithm for optimal approximate linear regression design: Optimization in matrix space
Keywords: 62K05; 90C25; Information matrix; Optimality criterion; Local optimal design; Convex hull; Efficiency; Gradient; Local quadratic approximation; Convex quadratic minimization; BFGS update; Multiplicative algorithm;
A remark on joint sparse recovery with OMP algorithm under restricted isometry property
Keywords: Compressed sensing; Joint sparse recovery; Greedy algorithms; Orthogonal Matching Pursuit; Restricted isometry property; 65D15; 68W40; 65J22; 15A29; 90C25;
On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
Keywords: Alternating direction method of multipliers; Hybrid proximal extragradient framework; Pointwise iteration-complexity; Convex programming; 47H05; 49M27; 90C25; 90C30; 90C60; 65K10;
On convergence rate of the randomized Kaczmarz method
Keywords: 65F10; 65F20; 65K05; 90C25; 15A06; CR:G1.3; System of linear equations; Randomized Kaczmarz method; Convergence rate;
Convergence of damped inertial dynamics governed by regularized maximally monotone operators
Keywords: 37N40; 46N10; 49M30; 65K05; 65K10; 90C25; Asymptotic stabilization; Damped inertial dynamics; Lyapunov analysis; Maximally monotone operators; Time-dependent viscosity; Yosida regularization;
Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
Keywords: circular cone programming; second-order cone programming; nonmonotone line search; smoothing Newton method; local quadratic convergence; 90C30; 90C25;
On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
Keywords: 65F08; 65F10; 65K05; 90C20; 90C25; Equality-constraint quadratic programming problem; Iteration method; Successive relaxation; Preconditioning; Asymptotic convergence;
Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity
Keywords: 37N40; 46N10; 49M30; 65K05; 65K10; 90B50; 90C25; Asymptotic stabilization; Convex optimization; Inertial gradient dynamics; Fast gradient method; Lyapunov analysis; Vanishing viscosity;
Convex optimisation-based methods for K-complex detection
Keywords: Convex optimisation; Signal approximation; Data analysis; Feature extraction; Biological signal classification92B05; 90C25; 90C90; 65D07; 65D15; 65K10
The structure of completely positive matrices according to their CP-rank and CP-plus-rank
Keywords: 15B48; 90C25; 15A23Copositive optimisation; Completely positive matrices; CP-rank; Nonnegative factorisation; Genericity
Second Order (F, α, ρ, d, E)-convex function and the Duality Problem
Keywords: 90C25; 90C30; 90C46; 90C29Second order (F, α, ρ, d, E)-convex function; Quasiconvex; Pesudoconvx; Duality problem
A new O(nL)-iteration predictor–corrector algorithm with wide neighborhood for semidefinite programming
Keywords: 90C25; 90C30Semidefinite programming; Predictor–corrector algorithm; Iteration complexity bound; Wide neighborhood
From seven to eleven: Completely positive matrices with high cp-rank
Keywords: 15B48; 90C25; 15A23Copositive optimization; Completely positive matrices; Cp-rank; Nonnegative factorization; Circular symmetry
Aggregate codifferential method for nonsmooth DC optimization
Keywords: 65K05; 90C25; Nonsmooth optimization; DC programming; Subdifferential; Codifferential;
On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
Keywords: 15A83; 52A27; 68Q32; 90C25; 90C90Nullspace property; Sparse recovery; Block-sparse recovery; Low-rank matrix recovery; Nuclear norm minimization
Characterizations of εε-duality gap statements for composed optimization problems
Keywords: 49N15; 90C25; 90C34Conjugate functions; εε-duality gap; Constraint qualifications; Fenchel–Lagrange dual
Variable metric quasi-Fejér monotonicity
Keywords: 65J05; 90C25; 47H09Convex feasibility problem; Convex optimization; Hilbert space; Inverse problems; Proximal Landweber method; Proximal point algorithm; Quasi-Fejér sequence; Variable metric
Proper approximate solutions and εε-subdifferentials in vector optimization: Basic properties and limit behaviour
Keywords: 90C48; 90C25; 90C29; 49J52; 49K27Vector optimization; Proper εε-efficiency; Proper εε-subdifferential; Nearly subconvexlikeness; Linear scalarization; εε-subdifferential
A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
Keywords: 90C20; 90C25; 90C60Algorithm complexity; Infimal convolution; Quadratic programming
Fixed point optimization algorithm and its application to network bandwidth allocation
Keywords: 65K15; 90C25; 90C26; 90C90Convex minimization problem; Network bandwidth allocation problem; Generalized convex feasible set; Nonexpansive mapping; Fixed point optimization algorithm
Robust duality for generalized convex programming problems under data uncertainty
Keywords: 90C22; 90C25; 90C46Robust optimization; Generalized convexity; Duality under uncertainty; Robust quadratic optimization