Implicit Optimality Criterion for Convex SIP Problem With Box Constrained Index Set

TOP - Germany
doi 10.1007/s11750-011-0189-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Optimality Conditions for a Cone-Convex Programming Problem

Journal of the Australian Mathematical Society
Mathematics
1979English

Uncertain Resource-Constrained Project Scheduling Problem With Net Present Value Criterion

Journal of Uncertainty Analysis and Applications
2016English

Implicit Snakes: Active Constrained Implicit Models

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method

International Journal of Mathematics and Mathematical Sciences
Mathematics
2018English

Iterative Algorithms Based on the Viscosity Approximation Method for Equilibrium and Constrained Convex Minimization Problem

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2012English

Convex Methods for Rank-Constrained Optimization Problems

2015English

Optimality of Index Policies for Stochastic Scheduling With Switching Penalties

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1992English

S-Box, SET, Match: A Toolbox for S-Box Analysis

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Continuous-Time Distributed Convex Optimization With Set Constraints

IFAC Proceedings Volumes
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy